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


Graphs

Author(s): Francisco Bueno.

Version: 1.10#6 (2004/8/7, 21:46:39 CEST)

Version of last change: 1.9#238 (2003/12/22, 18:25:58 CET)

This module implements utilities for work with graphs

Usage and interface (graphs)

Documentation on exports (graphs)

REGTYPE: dgraph/1:

dgraph(Graph)

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)

REGTYPE: dlgraph/1:

dlgraph(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)

PREDICATE: dgraph_to_ugraph/2:

Usage: dgraph_to_ugraph(+Graph, -UGraph)

PREDICATE: dlgraph_to_lgraph/2:

Usage: dlgraph_to_lgraph(+Graph, -LGraph)

PREDICATE: edges_to_ugraph/2:

Usage: edges_to_ugraph(+Edges, -UGraph)

PREDICATE: edges_to_lgraph/2:

Usage: edges_to_lgraph(+Edges, -LGraph)

Documentation on internals (graphs)

REGTYPE: pair/1:

Usage: pair(P)

REGTYPE: triple/1:

Usage: triple(P)


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