{ "_id": "6a630d9ed3420cf5dfdb677e", "Type": "Package", "Package": "tidygraph", "Title": "A Tidy API for Graph Manipulation", "Version": "1.3.1.9000", "Authors@R": "person(\"Thomas Lin\", \"Pedersen\", , \"thomasp85@gmail.com\", role = c(\"cre\", \"aut\"),\ncomment = c(ORCID = \"0000-0002-5147-4711\"))", "Maintainer": "Thomas Lin Pedersen ", "Description": "A graph, while not \"tidy\" in itself, can be thought of as\ntwo tidy data frames describing node and edge data\nrespectively. 'tidygraph' provides an approach to manipulate\nthese two virtual data frames using the API defined in the\n'dplyr' package, as well as provides tidy interfaces to a lot\nof common graph algorithms.", "License": "MIT + file LICENSE", "URL": "https://tidygraph.data-imaginist.com,\nhttps://github.com/thomasp85/tidygraph", "BugReports": "https://github.com/thomasp85/tidygraph/issues", "Encoding": "UTF-8", "Roxygen": "list(markdown = TRUE)", "RoxygenNote": "7.3.1", "Config/testthat/edition": "3", "Config/pak/sysreqs": "libglpk-dev libicu-dev libxml2-dev", "Repository": "https://thomasp85.r-universe.dev", "Date/Publication": "2025-02-05 21:38:50 UTC", "RemoteUrl": "https://github.com/thomasp85/tidygraph", "RemoteRef": "HEAD", "RemoteSha": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "NeedsCompilation": "yes", "Packaged": { "Date": "2026-07-24 06:11:37 UTC", "User": "root" }, "Author": "Thomas Lin Pedersen [cre, aut] (ORCID:\n)", "_user": "thomasp85", "_type": "src", "_file": "tidygraph_1.3.1.9000.tar.gz", "_fileid": "https://r2.ropensci.org/8bd283cea3724ef0a8089ad38008bebab38c33c060a39060be2b204f60eecfdf", "_filesize": 431440, "_sha256": "8bd283cea3724ef0a8089ad38008bebab38c33c060a39060be2b204f60eecfdf", "_expires": "2026-11-01T07:00:44.000Z", "_created": "2026-07-24T06:11:37.000Z", "_published": "2026-07-24T07:00:46.115Z", "_jobs": [ { "job": 89413365796, "time": 132, "config": "linux-devel-arm64", "r": "4.7.0", "check": "OK", "artifact": "8588247939" }, { "job": 89413365785, "time": 165, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "8588257372" }, { "job": 89413365794, "time": 129, "config": "linux-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "8588246757" }, { "job": 89413365770, "time": 152, "config": "linux-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "8588253930" }, { "job": 89413365806, "time": 92, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "OK", "artifact": "8589040093" }, { "job": 89413365788, "time": 218, "config": "macos-oldrel-x86_64", "r": "4.5.3", "check": "OK", "artifact": "8589105563" }, { "job": 89413365787, "time": 127, "config": "macos-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "8589081500" }, { "job": 89413365774, "time": 171, "config": "macos-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "8589107222" }, { "job": 89412862399, "time": 210, "config": "source", "r": "4.6.1", "check": "OK", "artifact": "8588206400" }, { "job": 89413365752, "time": 124, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "8588245251" }, { "job": 89413365836, "time": 118, "config": "windows-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "8588243599" }, { "job": 89413365799, "time": 118, "config": "windows-oldrel-x86_64", "r": "4.5.3", "check": "OK", "artifact": "8588243509" }, { "job": 89413365880, "time": 118, "config": "windows-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "8588244217" } ], "_host": "GitHub-Actions", "_buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607", "_status": "success", "_upstream": "https://github.com/thomasp85/tidygraph", "_commit": { "id": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "author": "David Schoch ", "committer": "GitHub ", "message": "removed netswan dependency (#203)\n\n", "time": 1738791530 }, "_maintainer": { "name": "Thomas Lin Pedersen", "email": "thomasp85@gmail.com", "login": "thomasp85", "mastodon": "@thomasp85@fosstodon.org", "linkedin": "in/thomasp85", "orcid": "0000-0002-5147-4711", "twitter": "@thomasp85", "description": "Maker of tools focusing on data science and data visualisation", "uuid": 1775316 }, "_distro": "resolute", "_registered": true, "_dependencies": [ { "package": "R", "version": ">= 4.1.0", "role": "Depends" }, { "package": "cpp11", "role": "LinkingTo" }, { "package": "cli", "role": "Imports" }, { "package": "dplyr", "version": ">= 0.8.5", "role": "Imports" }, { "package": "igraph", "version": ">= 2.0.0", "role": "Imports" }, { "package": "lifecycle", "role": "Imports" }, { "package": "magrittr", "role": "Imports" }, { "package": "pillar", "role": "Imports" }, { "package": "R6", "role": "Imports" }, { "package": "rlang", "role": "Imports" }, { "package": "stats", "role": "Imports" }, { "package": "tibble", "role": "Imports" }, { "package": "tidyr", "role": "Imports" }, { "package": "tools", "role": "Imports" }, { "package": "utils", "role": "Imports" }, { "package": "ape", "role": "Suggests" }, { "package": "covr", "role": "Suggests" }, { "package": "data.tree", "role": "Suggests" }, { "package": "graph", "role": "Suggests" }, { "package": "influenceR", "role": "Suggests" }, { "package": "methods", "role": "Suggests" }, { "package": "netrankr", "version": ">= 1.2.4", "role": "Suggests" }, { "package": "network", "role": "Suggests" }, { "package": "seriation", "role": "Suggests" }, { "package": "testthat", "version": ">= 3.0.0", "role": "Suggests" } ], "_owner": "thomasp85", "_selfowned": true, "_usedby": 192, "_updates": [], "_tags": [], "_topics": [ "graph-algorithms", "graph-manipulation", "igraph", "network-analysis", "tidyverse", "cpp" ], "_stars": 568, "_contributors": [ { "user": "thomasp85", "count": 303, "uuid": 1775316 }, { "user": "agila5", "count": 1, "uuid": 22221146 }, { "user": "chrmongeau", "count": 1, "uuid": 10231857 }, { "user": "schochastics", "count": 1, "uuid": 17147355 }, { "user": "flpezet", "count": 1, "uuid": 20605015 }, { "user": "jjchern", "count": 1, "uuid": 11262574 }, { "user": "jamesm131", "count": 1, "uuid": 20141156 }, { "user": "jdfoote", "count": 1, "uuid": 452218 }, { "user": "jonmcalder", "count": 1, "uuid": 5055818 }, { "user": "krlmlr", "count": 1, "uuid": 1741643 }, { "user": "lionel-", "count": 1, "uuid": 4465050 }, { "user": "luisdza", "count": 1, "uuid": 7270188 }, { "user": "malcolmbarrett", "count": 1, "uuid": 23123711 }, { "user": "maelle", "count": 1, "uuid": 8360597 }, { "user": "michaelchirico", "count": 1, "uuid": 7606389 }, { "user": "oliverbeagley", "count": 1, "uuid": 50335017 }, { "user": "ramorel", "count": 1, "uuid": 31448466 }, { "user": "rmflight", "count": 1, "uuid": 1509626 }, { "user": "romainfrancois", "count": 1, "uuid": 2625526 } ], "_userbio": { "uuid": 1775316, "type": "user", "name": "Thomas Lin Pedersen", "followers": 3276, "description": "Maker of tools focusing on data science and data visualisation" }, "_downloads": { "count": 70875, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/tidygraph" }, "_mentions": 23, "_devurl": "https://github.com/thomasp85/tidygraph", "_pkgdown": "https://tidygraph.data-imaginist.com", "_searchresults": 7280, "_rbuild": "4.6.1", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/NEWS.html", "extra/NEWS.txt", "extra/readme.html", "extra/readme.md", "extra/tidygraph.html", "LICENSE", "manual.pdf" ], "_homeurl": "https://github.com/thomasp85/tidygraph", "_realowner": "thomasp85", "_cranurl": true, "_releases": [ { "version": "1.0.0", "date": "2017-07-07" }, { "version": "1.1.0", "date": "2018-02-10" }, { "version": "1.1.1", "date": "2018-11-20" }, { "version": "1.1.2", "date": "2019-02-18" }, { "version": "1.2.0", "date": "2020-05-12" }, { "version": "1.2.1", "date": "2022-04-05" }, { "version": "1.2.2", "date": "2022-08-22" }, { "version": "1.2.3", "date": "2023-02-01" }, { "version": "1.3.0", "date": "2023-12-18" }, { "version": "1.3.1", "date": "2024-01-30" } ], "_exports": [ ".E", ".free_graph_context", ".G", ".graph_context", ".N", ".register_graph_context", "%>%", "%E>%", "%N>%", "activate", "active", "anti_join", "arrange", "as_tbl_graph", "as_tibble", "as.igraph", "bfs_after", "bfs_before", "bfs_dist", "bfs_parent", "bfs_rank", "bind_edges", "bind_graphs", "bind_nodes", "centrality_alpha", "centrality_authority", "centrality_betweenness", "centrality_betweenness_communicability", "centrality_betweenness_current", "centrality_betweenness_network", "centrality_betweenness_rsp_net", "centrality_betweenness_rsp_simple", "centrality_closeness", "centrality_closeness_generalised", "centrality_closeness_harmonic", "centrality_closeness_residual", "centrality_communicability", "centrality_communicability_even", "centrality_communicability_odd", "centrality_decay", "centrality_degree", "centrality_edge_betweenness", "centrality_eigen", "centrality_expected", "centrality_harmonic", "centrality_hub", "centrality_information", "centrality_integration", "centrality_katz", "centrality_manual", "centrality_pagerank", "centrality_power", "centrality_random_walk", "centrality_subgraph", "centrality_subgraph_even", "centrality_subgraph_odd", "contains", "convert", "create_bipartite", "create_chordal_ring", "create_citation", "create_complete", "create_de_bruijn", "create_empty", "create_kautz", "create_lattice", "create_notable", "create_path", "create_ring", "create_star", "create_tree", "crystallise", "crystallize", "dfs_dist", "dfs_parent", "dfs_rank", "dfs_rank_out", "distinct", "drop_na", "edge_is_between", "edge_is_bridge", "edge_is_feedback_arc", "edge_is_from", "edge_is_incident", "edge_is_loop", "edge_is_multiple", "edge_is_mutual", "edge_is_to", "edge_rank_eulerian", "ends_with", "everything", "filter", "focus", "full_join", "graph_adhesion", "graph_assortativity", "graph_asym_count", "graph_automorphisms", "graph_clique_count", "graph_clique_num", "graph_component_count", "graph_diameter", "graph_efficiency", "graph_girth", "graph_is_bipartite", "graph_is_chordal", "graph_is_complete", "graph_is_connected", "graph_is_dag", "graph_is_directed", "graph_is_eulerian", "graph_is_forest", "graph_is_isomorphic_to", "graph_is_simple", "graph_is_subgraph_isomorphic_to", "graph_is_tree", "graph_join", "graph_mean_dist", "graph_min_cut", "graph_modularity", "graph_motif_count", "graph_mutual_count", "graph_order", "graph_radius", "graph_reciprocity", "graph_size", "graph_unconn_count", "group_biconnected_component", "group_by", "group_color", "group_components", "group_data", "group_edge_betweenness", "group_fast_greedy", "group_fluid", "group_indices", "group_infomap", "group_keys", "group_label_prop", "group_leading_eigen", "group_leiden", "group_louvain", "group_optimal", "group_size", "group_spinglass", "group_vars", "group_walktrap", "groups", "inner_join", "is.tbl_graph", "iterate_n", "iterate_while", "left_join", "local_ave_degree", "local_members", "local_size", "local_transitivity", "local_triangles", "map_bfs", "map_bfs_back", "map_bfs_back_chr", "map_bfs_back_dbl", "map_bfs_back_int", "map_bfs_back_lgl", "map_bfs_chr", "map_bfs_dbl", "map_bfs_int", "map_bfs_lgl", "map_dfs", "map_dfs_back", "map_dfs_back_chr", "map_dfs_back_dbl", "map_dfs_back_int", "map_dfs_back_lgl", "map_dfs_chr", "map_dfs_dbl", "map_dfs_int", "map_dfs_lgl", "map_local", "map_local_chr", "map_local_dbl", "map_local_int", "map_local_lgl", "matches", "morph", "mutate", "mutate_all", "mutate_as_tbl", "mutate_at", "n", "n_groups", "node_adhesion_from", "node_adhesion_to", "node_bibcoupling_with", "node_bridging_score", "node_closeness_impact", "node_cocitation_with", "node_cohesion_from", "node_cohesion_to", "node_connectivity_impact", "node_constraint", "node_coreness", "node_distance_from", "node_distance_to", "node_diversity", "node_dominator", "node_eccentricity", "node_effective_network_size", "node_efficiency", "node_fareness_impact", "node_is_adjacent", "node_is_center", "node_is_connected", "node_is_cut", "node_is_isolated", "node_is_keyplayer", "node_is_leaf", "node_is_root", "node_is_simplical", "node_is_sink", "node_is_source", "node_is_universal", "node_max_flow_from", "node_max_flow_to", "node_rank_anneal", "node_rank_branch_bound", "node_rank_dendser", "node_rank_genetic", "node_rank_hclust", "node_rank_leafsort", "node_rank_mds", "node_rank_quadratic", "node_rank_spectral", "node_rank_spin_in", "node_rank_spin_out", "node_rank_traveller", "node_rank_two", "node_rank_visual", "node_similarity_with", "node_topo_order", "num_range", "one_of", "play_barabasi_albert", "play_barabasi_albert_aging", "play_bipartite", "play_blocks", "play_blocks_hierarchy", "play_citation_age", "play_citation_type", "play_degree", "play_dotprod", "play_erdos_renyi", "play_fitness", "play_fitness_power", "play_forestfire", "play_geometry", "play_gnm", "play_gnp", "play_growing", "play_islands", "play_preference", "play_preference_asym", "play_smallworld", "play_traits", "pull", "random_walk_rank", "rename", "replace_na", "reroute", "right_join", "sample_frac", "sample_n", "select", "semi_join", "slice", "slice_head", "slice_max", "slice_min", "slice_sample", "slice_tail", "starts_with", "tbl_graph", "tbl_vars", "to_bfs_tree", "to_complement", "to_components", "to_contracted", "to_dfs_tree", "to_directed", "to_dominator_tree", "to_hierarchical_clusters", "to_largest_component", "to_linegraph", "to_local_neighborhood", "to_minimum_spanning_tree", "to_random_spanning_tree", "to_shortest_path", "to_simple", "to_split", "to_subcomponent", "to_subgraph", "to_undirected", "to_unfolded_tree", "top_n", "transmute", "unfocus", "ungroup", "unmorph", "with_graph" ], "_help": [ { "page": "activate", "title": "Determine the context of subsequent manipulations", "topics": [ "%E>%", "%N>%", "activate", "active" ] }, { "page": "tbl_graph", "title": "A data structure for tidy graph manipulation", "topics": [ "as_tbl_graph", "as_tbl_graph.data.frame", "as_tbl_graph.default", "as_tbl_graph.dendrogram", "as_tbl_graph.evonet", "as_tbl_graph.graphAM", "as_tbl_graph.graphBAM", "as_tbl_graph.graphNEL", "as_tbl_graph.hclust", "as_tbl_graph.igraph", "as_tbl_graph.list", "as_tbl_graph.matrix", "as_tbl_graph.network", "as_tbl_graph.Node", "as_tbl_graph.phylo", "is.tbl_graph", "tbl_graph" ] }, { "page": "bind_graphs", "title": "Add graphs, nodes, or edges to a tbl_graph", "topics": [ "bind_edges", "bind_graphs", "bind_nodes" ] }, { "page": "centrality", "title": "Calculate node and edge centrality", "topics": [ "centrality", "centrality_alpha", "centrality_authority", "centrality_betweenness", "centrality_betweenness_communicability", "centrality_betweenness_current", "centrality_betweenness_network", "centrality_betweenness_rsp_net", "centrality_betweenness_rsp_simple", "centrality_closeness", "centrality_closeness_generalised", "centrality_closeness_harmonic", "centrality_closeness_residual", "centrality_communicability", "centrality_communicability_even", "centrality_communicability_odd", "centrality_decay", "centrality_degree", "centrality_edge_betweenness", "centrality_eigen", "centrality_expected", "centrality_harmonic", "centrality_hub", "centrality_information", "centrality_integration", "centrality_katz", "centrality_manual", "centrality_pagerank", "centrality_power", "centrality_random_walk", "centrality_subgraph", "centrality_subgraph_even", "centrality_subgraph_odd" ] }, { "page": "component_games", "title": "Graph games based on connected components", "concept": [ "graph games" ], "topics": [ "component_games", "play_blocks", "play_blocks_hierarchy", "play_islands", "play_smallworld" ] }, { "page": "context_accessors", "title": "Access graph, nodes, and edges directly inside verbs", "topics": [ ".E", ".G", ".N", "context_accessors" ] }, { "page": "create_graphs", "title": "Create different types of well-defined graphs", "topics": [ "create_bipartite", "create_chordal_ring", "create_citation", "create_complete", "create_de_bruijn", "create_empty", "create_graphs", "create_kautz", "create_lattice", "create_notable", "create_path", "create_ring", "create_star", "create_tree" ] }, { "page": "edge_rank", "title": "Calculate edge ranking", "topics": [ "edge_rank", "edge_rank_eulerian" ] }, { "page": "edge_types", "title": "Querying edge types", "topics": [ "edge_is_between", "edge_is_bridge", "edge_is_feedback_arc", "edge_is_from", "edge_is_incident", "edge_is_loop", "edge_is_multiple", "edge_is_mutual", "edge_is_to", "edge_types" ] }, { "page": "evolution_games", "title": "Graph games based on evolution", "concept": [ "graph games" ], "topics": [ "evolution_games", "play_barabasi_albert", "play_barabasi_albert_aging", "play_citation_age", "play_forestfire", "play_growing" ] }, { "page": "focus", "title": "Select specific nodes or edges to compute on", "topics": [ "focus", "focus.morphed_tbl_graph", "focus.tbl_graph", "unfocus", "unfocus.focused_tbl_graph", "unfocus.morphed_tbl_graph", "unfocus.tbl_graph" ] }, { "page": "graph_join", "title": "Join graphs on common nodes", "topics": [ "graph_join" ] }, { "page": "graph_measures", "title": "Graph measurements", "topics": [ "graph_adhesion", "graph_assortativity", "graph_asym_count", "graph_automorphisms", "graph_clique_count", "graph_clique_num", "graph_component_count", "graph_diameter", "graph_efficiency", "graph_girth", "graph_mean_dist", "graph_measures", "graph_min_cut", "graph_modularity", "graph_motif_count", "graph_mutual_count", "graph_order", "graph_radius", "graph_reciprocity", "graph_size", "graph_unconn_count" ] }, { "page": "graph_types", "title": "Querying graph types", "topics": [ "graph_is_bipartite", "graph_is_chordal", "graph_is_complete", "graph_is_connected", "graph_is_dag", "graph_is_directed", "graph_is_eulerian", "graph_is_forest", "graph_is_isomorphic_to", "graph_is_simple", "graph_is_subgraph_isomorphic_to", "graph_is_tree", "graph_types" ] }, { "page": "group_graph", "title": "Group nodes and edges based on community structure", "topics": [ "group_biconnected_component", "group_color", "group_components", "group_edge_betweenness", "group_fast_greedy", "group_fluid", "group_graph", "group_infomap", "group_label_prop", "group_leading_eigen", "group_leiden", "group_louvain", "group_optimal", "group_spinglass", "group_walktrap" ] }, { "page": "iterate", "title": "Repeatedly modify a graph by a function", "topics": [ "iterate", "iterate_n", "iterate_while" ] }, { "page": "local_graph", "title": "Measures based on the neighborhood of each node", "topics": [ "local_ave_degree", "local_graph", "local_members", "local_size", "local_transitivity", "local_triangles" ] }, { "page": "map_bfs", "title": "Apply a function to nodes in the order of a breath first search", "concept": [ "node map functions" ], "topics": [ "map_bfs", "map_bfs_chr", "map_bfs_dbl", "map_bfs_int", "map_bfs_lgl" ] }, { "page": "map_bfs_back", "title": "Apply a function to nodes in the reverse order of a breath first search", "concept": [ "node map functions" ], "topics": [ "map_bfs_back", "map_bfs_back_chr", "map_bfs_back_dbl", "map_bfs_back_int", "map_bfs_back_lgl" ] }, { "page": "map_dfs", "title": "Apply a function to nodes in the order of a depth first search", "concept": [ "node map functions" ], "topics": [ "map_dfs", "map_dfs_chr", "map_dfs_dbl", "map_dfs_int", "map_dfs_lgl" ] }, { "page": "map_dfs_back", "title": "Apply a function to nodes in the reverse order of a depth first search", "concept": [ "node map functions" ], "topics": [ "map_dfs_back", "map_dfs_back_chr", "map_dfs_back_dbl", "map_dfs_back_int", "map_dfs_back_lgl" ] }, { "page": "map_local", "title": "Map a function over a graph representing the neighborhood of each node", "topics": [ "map_local", "map_local_chr", "map_local_dbl", "map_local_int", "map_local_lgl" ] }, { "page": "morph", "title": "Create a temporary alternative representation of the graph to compute on", "topics": [ "convert", "crystallise", "crystallize", "morph", "unmorph" ] }, { "page": "morphers", "title": "Functions to generate alternate representations of graphs", "topics": [ "morphers", "to_bfs_tree", "to_complement", "to_components", "to_contracted", "to_dfs_tree", "to_directed", "to_dominator_tree", "to_hierarchical_clusters", "to_largest_component", "to_linegraph", "to_local_neighborhood", "to_minimum_spanning_tree", "to_random_spanning_tree", "to_shortest_path", "to_simple", "to_split", "to_subcomponent", "to_subgraph", "to_undirected", "to_unfolded_tree" ] }, { "page": "node_measures", "title": "Querying node measures", "topics": [ "node_bridging_score", "node_closeness_impact", "node_connectivity_impact", "node_constraint", "node_coreness", "node_diversity", "node_eccentricity", "node_effective_network_size", "node_efficiency", "node_fareness_impact", "node_measures" ] }, { "page": "node_rank", "title": "Calculate node ranking", "topics": [ "node_rank", "node_rank_anneal", "node_rank_branch_bound", "node_rank_dendser", "node_rank_genetic", "node_rank_hclust", "node_rank_leafsort", "node_rank_mds", "node_rank_quadratic", "node_rank_spectral", "node_rank_spin_in", "node_rank_spin_out", "node_rank_traveller", "node_rank_two", "node_rank_visual" ] }, { "page": "node_topology", "title": "Node properties related to the graph topology", "topics": [ "node_dominator", "node_topology", "node_topo_order" ] }, { "page": "node_types", "title": "Querying node types", "topics": [ "node_is_adjacent", "node_is_center", "node_is_connected", "node_is_cut", "node_is_isolated", "node_is_keyplayer", "node_is_leaf", "node_is_root", "node_is_simplical", "node_is_sink", "node_is_source", "node_is_universal", "node_types" ] }, { "page": "pair_measures", "title": "Calculate node pair properties", "topics": [ "node_adhesion_from", "node_adhesion_to", "node_bibcoupling_with", "node_cocitation_with", "node_cohesion_from", "node_cohesion_to", "node_distance_from", "node_distance_to", "node_max_flow_from", "node_max_flow_to", "node_similarity_with", "pair_measures" ] }, { "page": "random_walk_rank", "title": "Perform a random walk on the graph and return encounter rank", "topics": [ "random_walk_rank" ] }, { "page": "reroute", "title": "Change terminal nodes of edges", "topics": [ "reroute" ] }, { "page": "sampling_games", "title": "Graph games based on direct sampling", "concept": [ "graph games" ], "topics": [ "play_degree", "play_dotprod", "play_erdos_renyi", "play_fitness", "play_fitness_power", "play_geometry", "play_gnm", "play_gnp", "sampling_games" ] }, { "page": "search_graph", "title": "Search a graph with depth first and breath first", "topics": [ "bfs_after", "bfs_before", "bfs_dist", "bfs_parent", "bfs_rank", "dfs_dist", "dfs_parent", "dfs_rank", "dfs_rank_out", "search_graph" ] }, { "page": "type_games", "title": "Graph games based on different node types", "concept": [ "graph games" ], "topics": [ "play_bipartite", "play_citation_type", "play_preference", "play_preference_asym", "play_traits", "type_games" ] }, { "page": "with_graph", "title": "Evaluate a tidygraph algorithm in the context of a graph", "topics": [ "with_graph" ] } ], "_pkglogo": "https://github.com/thomasp85/tidygraph/raw/HEAD/man/figures/logo.png", "_readme": "https://github.com/thomasp85/tidygraph/raw/HEAD/README.md", "_rundeps": [ "cli", "cpp11", "dplyr", "generics", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "pillar", "pkgconfig", "purrr", "R6", "rlang", "stringi", "stringr", "tibble", "tidyr", "tidyselect", "utf8", "vctrs", "withr" ], "_sysdeps": [ { "shlib": "libstdc++", "package": "libstdc++6", "source": "gcc", "version": "16-20260322-1ubuntu1", "name": "c++", "homepage": "http://gcc.gnu.org/", "description": "GNU Standard C++ Library v3" } ], "_score": 15.181637779787557, "_indexed": true, "_nocasepkg": "tidygraph", "_universes": [ "thomasp85" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "1.3.1.9000", "date": "2026-07-24T06:13:44.000Z", "distro": "resolute", "arch": "aarch64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/4a5c2f2aceb51ab2d10d591a71f0cb1645bc716e8097b78a1840c658962deea0", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.7.0", "os": "linux", "version": "1.3.1.9000", "date": "2026-07-24T06:14:05.000Z", "distro": "resolute", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/9c53e3c2e27edee14cfe0d6ad61d22b7e5866e117b32e353a40e08692b6191b4", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.1", "os": "linux", "version": "1.3.1.9000", "date": "2026-07-24T06:13:40.000Z", "distro": "resolute", "arch": "aarch64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/3a913bcf0bf63b7516852fb348f2034e5f8cf55a28173d54b2bc6d8473661c95", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.1", "os": "linux", "version": "1.3.1.9000", "date": "2026-07-24T06:13:58.000Z", "distro": "resolute", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/57debb16e2c20fdd520e19956a16fa177db178af1175b16de4f30f6f48d649a2", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.5.3", "os": "mac", "version": "1.3.1.9000", "date": "2026-07-24T06:56:26.000Z", "arch": "aarch64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/669a1c8263b509057862472ac57f72c1ab69b3bc50502594e6ff92f119c378be", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.5.3", "os": "mac", "version": "1.3.1.9000", "date": "2026-07-24T06:58:54.000Z", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/eb8b1fe4c1143ca932528a75ba609a73e016c912bb0caa0820c5139fcc129434", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.1", "os": "mac", "version": "1.3.1.9000", "date": "2026-07-24T06:58:09.000Z", "arch": "aarch64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/f029e56fcfa6b51b366e5fd1923cd0893f8e0fa0b9606fe384a52c42a713e4b8", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.1", "os": "mac", "version": "1.3.1.9000", "date": "2026-07-24T06:59:03.000Z", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/e86c2f89512f7899ba8921b57b1c60a0117920e65d3bfb2807bbeab3fba79e98", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.0", "os": "wasm", "version": "1.3.1.9000", "date": "2026-07-24T06:14:00.000Z", "arch": "emscripten", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/eb14b1d71b5c623b5f8401a16b485594b8cdfefe433677bab56d257aeab35dfe", "status": "success", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.7.0", "os": "win", "version": "1.3.1.9000", "date": "2026-07-24T06:12:58.000Z", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/cb0868e904ab83333fef491b91eb5a9c0d9de00227f0fa80e524b3ef2cb51f23", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.5.3", "os": "win", "version": "1.3.1.9000", "date": "2026-07-24T06:13:00.000Z", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/9c979513675cd7c1bfcb637d13330af90d93330b4b23e86326894cdc9028e4f0", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" }, { "r": "4.6.1", "os": "win", "version": "1.3.1.9000", "date": "2026-07-24T06:13:04.000Z", "arch": "x86_64", "commit": "9a3385fcecc89b6f210c51c5bc9936797b100be4", "fileid": "https://r2.ropensci.org/4f3b5485c03640e307035bbde449da71a8756aee78a3b53989177ebf52a2f9a2", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/thomasp85/actions/runs/30071377607" } ] }