Package: tidygraph 1.3.1.9000
tidygraph: A Tidy API for Graph Manipulation
A graph, while not "tidy" in itself, can be thought of as two tidy data frames describing node and edge data respectively. 'tidygraph' provides an approach to manipulate these two virtual data frames using the API defined in the 'dplyr' package, as well as provides tidy interfaces to a lot of common graph algorithms.
Authors:
tidygraph_1.3.1.9000.tar.gz
tidygraph_1.3.1.9000.zip(r-4.5)tidygraph_1.3.1.9000.zip(r-4.4)tidygraph_1.3.1.9000.zip(r-4.3)
tidygraph_1.3.1.9000.tgz(r-4.4-x86_64)tidygraph_1.3.1.9000.tgz(r-4.4-arm64)tidygraph_1.3.1.9000.tgz(r-4.3-x86_64)tidygraph_1.3.1.9000.tgz(r-4.3-arm64)
tidygraph_1.3.1.9000.tar.gz(r-4.5-noble)tidygraph_1.3.1.9000.tar.gz(r-4.4-noble)
tidygraph_1.3.1.9000.tgz(r-4.4-emscripten)tidygraph_1.3.1.9000.tgz(r-4.3-emscripten)
tidygraph.pdf |tidygraph.html✨
tidygraph/json (API)
NEWS
| # Install 'tidygraph' in R: |
| install.packages('tidygraph', repos = c('https://thomasp85.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/thomasp85/tidygraph/issues
graph-algorithmsgraph-manipulationigraphnetwork-analysistidyverse
Last updated 7 months agofrom:382c2b7eec. Checks:OK: 8 NOTE: 1. Indexed: yes.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Aug 27 2024 |
| R-4.5-win-x86_64 | NOTE | Aug 27 2024 |
| R-4.5-linux-x86_64 | OK | Aug 27 2024 |
| R-4.4-win-x86_64 | OK | Aug 27 2024 |
| R-4.4-mac-x86_64 | OK | Aug 27 2024 |
| R-4.4-mac-aarch64 | OK | Aug 27 2024 |
| R-4.3-win-x86_64 | OK | Aug 27 2024 |
| R-4.3-mac-x86_64 | OK | Aug 27 2024 |
| R-4.3-mac-aarch64 | OK | Aug 27 2024 |
Exports:.E.free_graph_context.G.graph_context.N.register_graph_context%>%%E>%%N>%activateactiveanti_joinarrangeas_tbl_graphas_tibbleas.igraphbfs_afterbfs_beforebfs_distbfs_parentbfs_rankbind_edgesbind_graphsbind_nodescentrality_alphacentrality_authoritycentrality_betweennesscentrality_betweenness_communicabilitycentrality_betweenness_currentcentrality_betweenness_networkcentrality_betweenness_rsp_netcentrality_betweenness_rsp_simplecentrality_closenesscentrality_closeness_generalisedcentrality_closeness_harmoniccentrality_closeness_residualcentrality_communicabilitycentrality_communicability_evencentrality_communicability_oddcentrality_decaycentrality_degreecentrality_edge_betweennesscentrality_eigencentrality_expectedcentrality_harmoniccentrality_hubcentrality_informationcentrality_integrationcentrality_katzcentrality_manualcentrality_pagerankcentrality_powercentrality_random_walkcentrality_subgraphcentrality_subgraph_evencentrality_subgraph_oddcontainsconvertcreate_bipartitecreate_chordal_ringcreate_citationcreate_completecreate_de_bruijncreate_emptycreate_kautzcreate_latticecreate_notablecreate_pathcreate_ringcreate_starcreate_treecrystallisecrystallizedfs_distdfs_parentdfs_rankdfs_rank_outdistinctdrop_naedge_is_betweenedge_is_bridgeedge_is_feedback_arcedge_is_fromedge_is_incidentedge_is_loopedge_is_multipleedge_is_mutualedge_is_toedge_rank_eulerianends_witheverythingfilterfocusfull_joingraph_adhesiongraph_assortativitygraph_asym_countgraph_automorphismsgraph_clique_countgraph_clique_numgraph_component_countgraph_diametergraph_efficiencygraph_girthgraph_is_bipartitegraph_is_chordalgraph_is_completegraph_is_connectedgraph_is_daggraph_is_directedgraph_is_euleriangraph_is_forestgraph_is_isomorphic_tograph_is_simplegraph_is_subgraph_isomorphic_tograph_is_treegraph_joingraph_mean_distgraph_min_cutgraph_modularitygraph_motif_countgraph_mutual_countgraph_ordergraph_radiusgraph_reciprocitygraph_sizegraph_unconn_countgroup_biconnected_componentgroup_bygroup_colorgroup_componentsgroup_datagroup_edge_betweennessgroup_fast_greedygroup_fluidgroup_indicesgroup_infomapgroup_keysgroup_label_propgroup_leading_eigengroup_leidengroup_louvaingroup_optimalgroup_sizegroup_spinglassgroup_varsgroup_walktrapgroupsinner_joinis.tbl_graphiterate_niterate_whileleft_joinlocal_ave_degreelocal_memberslocal_sizelocal_transitivitylocal_trianglesmap_bfsmap_bfs_backmap_bfs_back_chrmap_bfs_back_dblmap_bfs_back_intmap_bfs_back_lglmap_bfs_chrmap_bfs_dblmap_bfs_intmap_bfs_lglmap_dfsmap_dfs_backmap_dfs_back_chrmap_dfs_back_dblmap_dfs_back_intmap_dfs_back_lglmap_dfs_chrmap_dfs_dblmap_dfs_intmap_dfs_lglmap_localmap_local_chrmap_local_dblmap_local_intmap_local_lglmatchesmorphmutatemutate_allmutate_as_tblmutate_atnn_groupsnode_adhesion_fromnode_adhesion_tonode_bibcoupling_withnode_bridging_scorenode_closeness_impactnode_cocitation_withnode_cohesion_fromnode_cohesion_tonode_connectivity_impactnode_constraintnode_corenessnode_distance_fromnode_distance_tonode_diversitynode_dominatornode_eccentricitynode_effective_network_sizenode_efficiencynode_fareness_impactnode_is_adjacentnode_is_centernode_is_connectednode_is_cutnode_is_isolatednode_is_keyplayernode_is_leafnode_is_rootnode_is_simplicalnode_is_sinknode_is_sourcenode_is_universalnode_max_flow_fromnode_max_flow_tonode_rank_annealnode_rank_branch_boundnode_rank_dendsernode_rank_geneticnode_rank_hclustnode_rank_leafsortnode_rank_mdsnode_rank_quadraticnode_rank_spectralnode_rank_spin_innode_rank_spin_outnode_rank_travellernode_rank_twonode_rank_visualnode_similarity_withnode_topo_ordernum_rangeone_ofplay_barabasi_albertplay_barabasi_albert_agingplay_bipartiteplay_blocksplay_blocks_hierarchyplay_citation_ageplay_citation_typeplay_degreeplay_dotprodplay_erdos_renyiplay_fitnessplay_fitness_powerplay_forestfireplay_geometryplay_gnmplay_gnpplay_growingplay_islandsplay_preferenceplay_preference_asymplay_smallworldplay_traitspullrandom_walk_rankrenamereplace_narerouteright_joinsample_fracsample_nselectsemi_joinsliceslice_headslice_maxslice_minslice_sampleslice_tailstarts_withtbl_graphtbl_varsto_bfs_treeto_complementto_componentsto_contractedto_dfs_treeto_directedto_dominator_treeto_hierarchical_clustersto_largest_componentto_linegraphto_local_neighborhoodto_minimum_spanning_treeto_random_spanning_treeto_shortest_pathto_simpleto_splitto_subcomponentto_subgraphto_undirectedto_unfolded_treetop_ntransmuteunfocusungroupunmorphwith_graph
Dependencies:clicpp11dplyrfansigenericsglueigraphlatticelifecyclemagrittrMatrixpillarpkgconfigpurrrR6rlangstringistringrtibbletidyrtidyselectutf8vctrswithr
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Determine the context of subsequent manipulations | %E>% %N>% activate active |
| A data structure for tidy graph manipulation | 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 |
| Add graphs, nodes, or edges to a tbl_graph | bind_edges bind_graphs bind_nodes |
| Calculate node and edge centrality | 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 |
| Graph games based on connected components | component_games play_blocks play_blocks_hierarchy play_islands play_smallworld |
| Access graph, nodes, and edges directly inside verbs | .E .G .N context_accessors |
| Create different types of well-defined graphs | 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 |
| Calculate edge ranking | edge_rank edge_rank_eulerian |
| Querying edge types | 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 |
| Graph games based on evolution | evolution_games play_barabasi_albert play_barabasi_albert_aging play_citation_age play_forestfire play_growing |
| Select specific nodes or edges to compute on | focus focus.morphed_tbl_graph focus.tbl_graph unfocus unfocus.focused_tbl_graph unfocus.morphed_tbl_graph unfocus.tbl_graph |
| Join graphs on common nodes | graph_join |
| Graph measurements | 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 |
| Querying graph types | 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 |
| Group nodes and edges based on community structure | 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 |
| Repeatedly modify a graph by a function | iterate iterate_n iterate_while |
| Measures based on the neighborhood of each node | local_ave_degree local_graph local_members local_size local_transitivity local_triangles |
| Apply a function to nodes in the order of a breath first search | map_bfs map_bfs_chr map_bfs_dbl map_bfs_int map_bfs_lgl |
| Apply a function to nodes in the reverse order of a breath first search | map_bfs_back map_bfs_back_chr map_bfs_back_dbl map_bfs_back_int map_bfs_back_lgl |
| Apply a function to nodes in the order of a depth first search | map_dfs map_dfs_chr map_dfs_dbl map_dfs_int map_dfs_lgl |
| Apply a function to nodes in the reverse order of a depth first search | map_dfs_back map_dfs_back_chr map_dfs_back_dbl map_dfs_back_int map_dfs_back_lgl |
| Map a function over a graph representing the neighborhood of each node | map_local map_local_chr map_local_dbl map_local_int map_local_lgl |
| Create a temporary alternative representation of the graph to compute on | convert crystallise crystallize morph unmorph |
| Functions to generate alternate representations of graphs | 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 |
| Querying node measures | 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 |
| Calculate node ranking | 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 |
| Node properties related to the graph topology | node_dominator node_topology node_topo_order |
| Querying node types | 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 |
| Calculate node pair properties | 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 |
| Perform a random walk on the graph and return encounter rank | random_walk_rank |
| Change terminal nodes of edges | reroute |
| Graph games based on direct sampling | play_degree play_dotprod play_erdos_renyi play_fitness play_fitness_power play_geometry play_gnm play_gnp sampling_games |
| Search a graph with depth first and breath first | bfs_after bfs_before bfs_dist bfs_parent bfs_rank dfs_dist dfs_parent dfs_rank dfs_rank_out search_graph |
| Graph games based on different node types | play_bipartite play_citation_type play_preference play_preference_asym play_traits type_games |
| Evaluate a tidygraph algorithm in the context of a graph | with_graph |
