add_edge!(g, u, v, id)

Add an edge (u, v) to the StorageGraph g with the given id. Return true if the edge has been added, false otherwise.

add_vertex!(g)
add_vertex!(g, data)

Add a vertex to the StorageGraph g with optional data given by the NamedTuple data. Return true if the vertex has been added, false otherwise.

add_path!(g, source, dest; id=maxid(g))

Create a path between the source node and the destination one. If the nodes do not exist, they are created.

extractvals(nodes, name::Symbol)

Return an array of values corresponding to name form the array of NamedTuples nodes.

findnodes(g, name::Symbol)

Finds the nodes containing name.

rem_prop!(g, v)
rem_prop!(g, e)
rem_prop!(g, s, d)

Remove the specific property (data for vertices, ids for edges) from graph g, vertex v, or edge e (optionally referenced by source vertex s and destination vertex d). If property, vertex, or edge does not exist, will not do anything.

walkpath!(g, path, start, neighborfn, action!; stopcond=(g,v)->false)

Walk on the given path and take an action at each node. The action is specified by a function action!(g, v, neighbors) and it can modify the graph.