Author(s): M. Carlsson, adapted from shared code written by Richard A O'Keefe. Mods by F.Bueno and M.Carro..
Version: 1.10#6 (2004/8/7, 21:46:39 CEST)
Version of last change: 0.9#105 (1999/6/4, 12:24:49 MEST)
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
(U,V) is represented as the term
A vertex can be any term. Two vertices are distinct iff they are not identical (
A path is represented as a list of vertices. No vertex can appear twice in a path.
No further documentation available for this predicate.
neighbors(+Vertex, +Graph, -Neighbors)
Vertexis a vertex in
Neighborsare its neighbors.
Edgeswith the edges in
del_vertices(+Graph1, +Vertices, -Graph2)
Verticesand all edges to and from
Verticesremoved from it.
Verticeswith the vertices in
add_vertices(+Graph1, +Vertices, -Graph2)
Verticesadded to it.
add_edges(+Graph1, +Edges, -Graph2)
Edgesand their 'to' and 'from' vertices added to it.
Transposeis the graph computed by replacing each edge
Graphby its symmetric edge
(v,u). It can only be used one way around. The cost is O(N^2).
point_to(+Vertex, +Graph, -Point_to)
Point_tois the list of nodes which go directly to
Graphis an ugraph.
Go to the first, previous, next, last section, table of contents.