{ "_id": "6a1ea737b25058d4daad8dcc", "Package": "gor", "Title": "Algorithms for the Subject Graphs and Network Optimization", "Version": "2.0", "Authors@R": "person(given = \"Cesar\",\nfamily = \"Asensio\",\nrole = c(\"aut\", \"cre\"),\nemail = \"casencha@unizar.es\",\ncomment = c(ORCID = \"0000-0002-7538-1501\"))", "Description": "Informal implementation of some algorithms from Graph\nTheory and Combinatorial Optimization which arise in the\nsubject \"Graphs and Network Optimization\" from first course of\nthe EUPLA degree of Data Engineering in Industrial Processes.", "License": "GPL-3", "Encoding": "UTF-8", "RoxygenNote": "7.3.2", "Config/testthat/edition": "3", "NeedsCompilation": "no", "Packaged": { "Date": "2026-06-02 09:46:43 UTC", "User": "root" }, "Author": "Cesar Asensio [aut, cre] (ORCID:\n)", "Maintainer": "Cesar Asensio ", "Repository": "https://cran.r-universe.dev", "Date/Publication": "2025-09-01 13:00:08 UTC", "RemoteUrl": "https://github.com/cran/gor", "RemoteRef": "HEAD", "RemoteSha": "f080ce310ae418da4a647d7730bcc51abbd6182a", "MD5sum": "142efe1235f0c5e93424f7174c256380", "_user": "cran", "_type": "src", "_file": "gor_2.0.tar.gz", "_fileid": "46875d5a196bd678faed3b9c3641eb6f2be85ff3dfaf0a4bb73d9c7e40d78af3", "_filesize": 445933, "_sha256": "46875d5a196bd678faed3b9c3641eb6f2be85ff3dfaf0a4bb73d9c7e40d78af3", "_created": "2026-06-02T09:46:43.000Z", "_published": "2026-06-02T09:49:43.673Z", "_distro": "noble", "_jobs": [ { "job": 79043842437, "time": 132, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "7354416958" }, { "job": 79043842438, "time": 135, "config": "linux-release-x86_64", "r": "4.6.0", "check": "OK", "artifact": "7354417631" }, { "job": 79043304207, "time": 187, "config": "source", "r": "4.6.0", "check": "OK", "artifact": "7354368739" }, { "job": 79043842525, "time": 108, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "7354408415" } ], "_buildurl": "https://github.com/r-universe/cran/actions/runs/26811735713", "_status": "success", "_host": "GitHub-Actions", "_upstream": "https://github.com/cran/gor", "_commit": { "id": "f080ce310ae418da4a647d7730bcc51abbd6182a", "author": "Cesar Asensio ", "committer": "cran-robot ", "message": "version 2.0\n", "time": 1756731608 }, "_maintainer": { "name": "Cesar Asensio", "email": "casencha@unizar.es", "orcid": "0000-0002-7538-1501" }, "_registered": true, "_dependencies": [ { "package": "igraph", "role": "Imports" }, { "package": "testthat", "version": ">= 3.0.0", "role": "Suggests" } ], "_owner": "cran", "_selfowned": false, "_usedby": 1, "_updates": [ { "week": "2025-36", "n": 1 } ], "_tags": [ { "name": "2.0", "date": "2025-09-01" } ], "_stars": 0, "_userbio": { "uuid": 6899542, "type": "organization", "name": "cran", "description": "Unofficial read-only mirror of all CRAN R packages" }, "_downloads": { "count": 258, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/gor" }, "_searchresults": 7, "_rbuild": "4.6.0", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/gor.html", "manual.pdf" ], "_realowner": "cran", "_cranurl": false, "_releases": [ { "version": "1.0", "date": "2023-05-03" }, { "version": "2.0", "date": "2025-09-01" } ], "_exports": [ "apply_incidence_map", "bfs_tree", "build_cover_approx", "build_cover_greedy", "build_cover_random", "build_cut_greedy", "build_cut_random", "build_tour_2tree", "build_tour_greedy", "build_tour_nn", "build_tour_nn_best", "color_graph_greedy", "compute_cut_weight", "compute_distance_matrix", "compute_gain_transp", "compute_lower_bound_1tree", "compute_lower_bound_HK", "compute_p_distance", "compute_path_distance", "compute_tour_distance", "crossover_sequences", "crossover_tours", "dfs_tree", "dijk", "find_cover_BB", "find_euler", "find_tour_BB", "gauge_tour", "generate_fundamental_cycles", "improve_cover_flip", "improve_cut_flip", "improve_tour_2opt", "improve_tour_3opt", "improve_tour_LinKer", "is_cover", "krus", "make_cube", "mutate_binary_sequence", "neigh_index", "next_index", "perturb_tour_4exc", "plot_cover", "plot_cut", "plot_tour", "prim", "search_cover_ants", "search_cover_random", "search_cut_genetic", "search_tour_ants", "search_tour_chain2opt", "search_tour_genetic", "shave_cycle", "sum_g" ], "_help": [ { "page": "apply_incidence_map", "title": "Apply incidence map of a graph to an edge vector", "topics": [ "apply_incidence_map" ] }, { "page": "bfs_tree", "title": "Breadth-first search tree", "topics": [ "bfs_tree" ] }, { "page": "build_cover_approx", "title": "2-approximation algorithm for vertex cover", "topics": [ "build_cover_approx" ] }, { "page": "build_cover_greedy", "title": "Greedy algorithm for vertex cover in a graph", "topics": [ "build_cover_greedy" ] }, { "page": "build_cover_random", "title": "Random vertex covers", "topics": [ "build_cover_random" ] }, { "page": "build_cut_greedy", "title": "Greedy algorithm aimed to build a large weight cut in a graph", "topics": [ "build_cut_greedy" ] }, { "page": "build_cut_random", "title": "Random cut generation on a graph", "topics": [ "build_cut_random" ] }, { "page": "build_tour_2tree", "title": "Double-tree heuristic for TSP", "topics": [ "build_tour_2tree" ] }, { "page": "build_tour_greedy", "title": "Building a tour for a TSP using the greedy heuristic", "topics": [ "build_tour_greedy" ] }, { "page": "build_tour_nn", "title": "Building a tour for a TSP using the nearest neighbor heuristic", "topics": [ "build_tour_nn" ] }, { "page": "build_tour_nn_best", "title": "Build a tour for a TSP using the best nearest neighbor heuristic", "topics": [ "build_tour_nn_best" ] }, { "page": "color_graph_greedy", "title": "Greedy coloring of a graph", "topics": [ "color_graph_greedy" ] }, { "page": "compute_cut_weight", "title": "Compute cut weight and size", "topics": [ "compute_cut_weight" ] }, { "page": "compute_distance_matrix", "title": "p-distance matrix computation", "topics": [ "compute_distance_matrix" ] }, { "page": "compute_gain_transp", "title": "Distance gain when transposing two cities in a tour", "topics": [ "compute_gain_transp" ] }, { "page": "compute_lower_bound_1tree", "title": "Computing the 1-tree lower bound for a TSP instance", "topics": [ "compute_lower_bound_1tree" ] }, { "page": "compute_lower_bound_HK", "title": "Held-Karp lower bound estimate", "topics": [ "compute_lower_bound_HK" ] }, { "page": "compute_p_distance", "title": "Distance-p between two-dimensional points", "topics": [ "compute_p_distance" ] }, { "page": "compute_path_distance", "title": "Compute the distance of a TSP path", "topics": [ "compute_path_distance" ] }, { "page": "compute_tour_distance", "title": "Compute the distance of a TSP tour", "topics": [ "compute_tour_distance" ] }, { "page": "crossover_sequences", "title": "Crossover of sequences", "topics": [ "crossover_sequences" ] }, { "page": "crossover_tours", "title": "Crossover operation used by the TSP genetic algorithm", "topics": [ "crossover_tours" ] }, { "page": "dfs_tree", "title": "Depth-first search tree", "topics": [ "dfs_tree" ] }, { "page": "dijk", "title": "Dijkstra' algorithm for shortest paths", "topics": [ "dijk" ] }, { "page": "find_cover_BB", "title": "Branch-and-Bound algorithm for the Vertex-Cover problem", "topics": [ "find_cover_BB" ] }, { "page": "find_euler", "title": "Constructing an Eulerian Cycle", "topics": [ "find_euler" ] }, { "page": "find_tour_BB", "title": "Branch-and-Bound algorithm for the TSP", "topics": [ "find_tour_BB" ] }, { "page": "gauge_tour", "title": "Gauging a tour", "topics": [ "gauge_tour" ] }, { "page": "generate_fundamental_cycles", "title": "Generate fundamental cycles in a connected graph", "topics": [ "generate_fundamental_cycles" ] }, { "page": "improve_cover_flip", "title": "Improving a cover with local search", "topics": [ "improve_cover_flip" ] }, { "page": "improve_cut_flip", "title": "Improving a cut with local search", "topics": [ "improve_cut_flip" ] }, { "page": "improve_tour_2opt", "title": "Tour improving for a TSP using the 2-opt heuristic", "topics": [ "improve_tour_2opt" ] }, { "page": "improve_tour_3opt", "title": "Tour improving for a TSP using the 3-opt heuristic", "topics": [ "improve_tour_3opt" ] }, { "page": "improve_tour_LinKer", "title": "Tour improving for a TSP using a poor version of the Lin-Kernighan heuristic", "topics": [ "improve_tour_LinKer" ] }, { "page": "is_cover", "title": "Check vertex cover", "topics": [ "is_cover" ] }, { "page": "krus", "title": "Minimum spanning tree (Boruvka-Kruskal algorithm)", "topics": [ "krus" ] }, { "page": "make_cube", "title": "Multidimensional cube graph", "topics": [ "make_cube" ] }, { "page": "mutate_binary_sequence", "title": "Binary sequence mutation", "topics": [ "mutate_binary_sequence" ] }, { "page": "neigh_index", "title": "Previous, current, and next positions of a given index in a cycle.", "topics": [ "neigh_index" ] }, { "page": "next_index", "title": "Next position to i in a cycle", "topics": [ "next_index" ] }, { "page": "perturb_tour_4exc", "title": "Random 4-exchange transformation", "topics": [ "perturb_tour_4exc" ] }, { "page": "plot_cover", "title": "Vertex cover plotting", "topics": [ "plot_cover" ] }, { "page": "plot_cut", "title": "Cut plotting", "topics": [ "plot_cut" ] }, { "page": "plot_tour", "title": "TSP tour simple plotting", "topics": [ "plot_tour" ] }, { "page": "prim", "title": "Minimum spanning tree (Jarnik-Prim algorithm)", "topics": [ "prim" ] }, { "page": "search_cover_ants", "title": "Ant colony optimization algorithm for Vertex-Cover", "topics": [ "search_cover_ants" ] }, { "page": "search_cover_random", "title": "Random vertex covers", "topics": [ "search_cover_random" ] }, { "page": "search_cut_genetic", "title": "Genetic Algorithm for Max-Cut", "topics": [ "search_cut_genetic" ] }, { "page": "search_tour_ants", "title": "Ant colony optimization algorithm for the TSP", "topics": [ "search_tour_ants" ] }, { "page": "search_tour_chain2opt", "title": "Chained 2-opt search with multiple, random starting tours", "topics": [ "search_tour_chain2opt" ] }, { "page": "search_tour_genetic", "title": "Genetic Algorithm for the TSP", "topics": [ "search_tour_genetic" ] }, { "page": "shave_cycle", "title": "Shaving a hairy cycle", "topics": [ "shave_cycle" ] }, { "page": "sum_g", "title": "Sum of the higher terms of a list", "topics": [ "sum_g" ] } ], "_rundeps": [ "cli", "cpp11", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "pkgconfig", "rlang", "vctrs" ], "_score": 1.4771212547196624, "_indexed": true, "_nocasepkg": "gor", "_universes": [ "cran" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "2.0", "date": "2026-06-02T09:48:48.000Z", "distro": "noble", "commit": "f080ce310ae418da4a647d7730bcc51abbd6182a", "fileid": "d6453db9a119c4af089429c93f78e467510a49ae419e461f62eb586ea26e2e24", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/26811735713" }, { "r": "4.6.0", "os": "linux", "version": "2.0", "date": "2026-06-02T09:48:49.000Z", "distro": "noble", "commit": "f080ce310ae418da4a647d7730bcc51abbd6182a", "fileid": "2dd22b5450913b08f37e5f18e393f6cec65d1e64c6bcde3965fd95b13e3f5cf7", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/26811735713" }, { "r": "4.6.0", "os": "wasm", "version": "2.0", "date": "2026-06-02T09:48:54.000Z", "commit": "f080ce310ae418da4a647d7730bcc51abbd6182a", "fileid": "752ad35ad8d4d0e2ad7f90eb35a4ee12e18521ef20eed6f8c7211459408dac1b", "status": "success", "buildurl": "https://github.com/r-universe/cran/actions/runs/26811735713" } ] }