An unweighted directed graph (ugraph) is represented as a list of (vertex-neighbors) pairs, where the pairs are in standard order (as produced by keysort with unique keys) and the neighbors of each vertex are also in standard order (as produced by sort), and every neighbor appears as a vertex even if it has no neighbors itself.
An undirected graph is represented as a directed graph where for each edge (U,V) there is a symmetric edge (V,U).
An edge (U,V) is represented as the term U-V.
A vertex can be any term. Two vertices are distinct iff they are not identical (==/2).
A path is represented as a list of vertices. No vertex can appear twice in a path.
Is true if Vertex is a vertex in Graph and Neighbors are its neighbors.
Is true if Graph2 is Graph1 with Edges removed from it.
Is true if Graph2 is Graph1 with Edges and their 'to' and 'from' vertices added to it.
Is true if Graph2 is Graph1 with Vertices and all edges to and from Vertices removed from it.
Is true if Graph2 is Graph1 with Vertices added to it.
Is true if Transpose is the graph computed by replacing each edge (u,v) in Graph by its symmetric edge (v,u). It can only be used one way around. The cost is O(N^2).
SubGraph is the subgraph of Graph which is reachable from Sources.
Is true if Point_to is the list of nodes which go directly to Vertex in Graph.
Graph is an ugraph.