play_erdos_renyi() for creating graphs with a fixed edge probability). Lastly, tidygraph also wraps the multitude of graph constructors available in igraph and exports them under the create_*() family of functions for deterministic constructors (e.g. the call to create_ring(10) above) and the play_*() family for constructors that incorporate sampling (e.g. graphNEL, graphAM, graphBAM from graph (in Bioconductor)įor all of the coercions you can expect that data on the nodes and edges are kept and available after conversion to tbl_graph: iris_clust # A tbl_graph: 299 nodes and 298 edges.The following list gives the packages/classes that can currently be converted to tbl_graphs, using the as_tbl_graph function: On top of that, tidygraph also provides coercion from a huge amount of relational data structures. Tbl_graph objects can be created directly using the tbl_graph() function that takes a node ame and an edge ame. #> # An undirected simple graph with 1 component To underline the tidyness of the tbl_graph class the print method shows the object as two tibbles along with additional network information. Further, tidygraph is very careful not to override any of igraphs exports so the two packages can coexist quite happily. This ensures that all your beloved algorithms that expects igraph objects still works with tbl_graph objects. Rather than keeping the node and edge data in a list and creating igraph objects on the fly when needed, tidygraph subclasses igraph with the tbl_graph class and simply exposes it in a tidy manner. Underneath the hood of tidygraph lies the well-oiled machinery of igraph, ensuring efficient graph manipulation.
0 kommentar(er)
