This module implements utilities for work with graphs
A directed graph is a term graph(V,E) where V is a list of vertices and E is a list of edges (none necessarily sorted). Edges are pairs of vertices which are directed, i.e., (a,b) represents a->b. Two vertices a and b are equal only if a==b.
Usage:dgraph(Graph)
Graph is a directed graph.
A labeled directed graph is a directed graph where edges are triples of the form (a,l,b) where l is the label of the edge (a,b).
Usage:dlgraph(Graph)
Graph is a directed labeled graph.
Usage:dgraph_to_ugraph(Graph,UGraph)
Converts Graph to UGraph.
Usage:dlgraph_to_lgraph(Graph,LGraph)
Converts Edges to LGraph.
Usage:edges_to_ugraph(Edges,UGraph)
Converts Graph to UGraph.
Usage:edges_to_lgraph(Edges,LGraph)
Converts Edges to LGraph.
Usage:pair(P)
P is a pair (_,_).
Usage:triple(P)
P is a triple (_,_,_).