Man pages for vh-d/datagraphs
Graph data structures with pass-by-reference semantics

add_edgesAdd an edge
add_verticesAdd vertices
are_adjacentTest if two vertices are adjacent (direct neighbors)
as.datagraphConstructors of datagraph objects
checkCheck/test a datagraph object's consistency
collapse_verticesCollapse vertices
copy_ofMake a copy
detect_cyclesTest that graph contains cycles
edgesList all edges in a graph
foreachRun a function for each member.
is.datagraphFunction to check if an object is a datagraph
neighborhoodAdjacent vertices
remove_edgesRemove edges between vertices
remove_vertexRemove vertices from a x
remove_verticesRemove vertices from a graph
union.datagraphUnion multiple datagraphs into a single datagraph object
verticesList all vertices in a graph
vh-d/datagraphs documentation built on May 13, 2022, 1:42 p.m.