Go to the first, previous, next, last section, table of contents.


Unweighted graph-processing utilities

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 (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.

Usage and interface (ugraphs)

Documentation on exports (ugraphs)

PREDICATE: vertices_edges_to_ugraph/3:

No further documentation available for this predicate.

PREDICATE: neighbors/3:

Usage: neighbors(+Vertex, +Graph, -Neighbors)

PREDICATE: edges/2:

Usage: edges(+Graph, -Edges)

PREDICATE: del_vertices/3:

Usage: del_vertices(+Graph1, +Vertices, -Graph2)

PREDICATE: vertices/2:

Usage: vertices(+Graph, -Vertices)

PREDICATE: add_vertices/3:

Usage: add_vertices(+Graph1, +Vertices, -Graph2)

PREDICATE: add_edges/3:

Usage: add_edges(+Graph1, +Edges, -Graph2)

PREDICATE: transpose/2:

Usage: transpose(+Graph, -Transpose)

PREDICATE: point_to/3:

Usage: point_to(+Vertex, +Graph, -Point_to)

REGTYPE: ugraph/1:

Usage: ugraph(Graph)


Go to the first, previous, next, last section, table of contents.