add edge Current Graph is changed.
Add a edge Current Graph is changed.
Add another graph Current graph is changed.
Add a vertex Current Graph is changed.
clone the graph
all edges
edges connected to node
check whether there is a loop
Check whether there are two edges connecting two nodes.
in degree
incoming edges.
check empty
Map a graph to a new graph, with edge converted to new type Current graph is not changed.
Map a graph to a new graph, with vertex converted to a new type Current Graph is not changed.
out degree
out going edges.
Remove vertex Current Graph is changed.
replace vertex, the current Graph is mutated.
sub-graph which contains current node and all neighbour nodes and edges.
Return an iterator of vertex in topological order The node returned by Iterator is stable sorted.
Return an iterator of vertex in topological order of graph with circles The node returned by Iterator is stable sorted.
Return an iterator of vertex in topological order of graph with circles The node returned by Iterator is stable sorted.
The reference of this algorithm is: http://www.drdobbs.com/database/topological-sorting/184410262
Generate a level map for each vertex withholding:
Generate a level map for each vertex withholding:
if vertex A -> B, then level(A) -> level(B)
return all vertices.
return all vertices. The result is stable
Generic mutable Graph libraries.