Graphs

Author(s): F. Bueno.

Version: 1.5#118 (2000/4/19, 18:13:43 CEST)

Version of last change: 1.5#83 (2000/3/23, 19:23:58 CET)

• Usage and interface (graphs)
• Documentation on exports (graphs)
• Documentation on internals (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)

• Description: Graph is a directed 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)

• Description: Graph is a directed labeled graph.

PREDICATE: dgraph_to_ugraph/2:

Usage: dgraph_to_ugraph(+Graph,-(UGraph))

• Description: Converts Graph to UGraph.
• The following properties should hold at call time: +Graph is a directed graph. (graphs:dgraph/1) -(UGraph) is a free variable. (term_typing:var/1)
• The following properties should hold upon exit: +Graph is a directed graph. (graphs:dgraph/1) -(UGraph) is an ugraph. (ugraphs:ugraph/1)

PREDICATE: dlgraph_to_lgraph/2:

Usage: dlgraph_to_lgraph(+Graph,-(LGraph))

• Description: Converts Edges to LGraph.
• The following properties should hold at call time: +Graph is a directed labeled graph. (graphs:dlgraph/1) -(LGraph) is a free variable. (term_typing:var/1)
• The following properties should hold upon exit: +Graph is a directed labeled graph. (graphs:dlgraph/1) -(LGraph) is a labeled graph of term terms. (lgraphs:lgraph/2)

PREDICATE: edges_to_ugraph/2:

Usage: edges_to_ugraph(+Edges,-(UGraph))

• Description: Converts Graph to UGraph.
• The following properties should hold at call time: +Edges is a list of pairs. (basic_props:list/2) -(UGraph) is a free variable. (term_typing:var/1)
• The following properties should hold upon exit: +Edges is a list of pairs. (basic_props:list/2) -(UGraph) is an ugraph. (ugraphs:ugraph/1)

PREDICATE: edges_to_lgraph/2:

Usage: edges_to_lgraph(+Edges,-(LGraph))

• Description: Converts Edges to LGraph.
• The following properties should hold at call time: +Edges is a list of triples. (basic_props:list/2) -(LGraph) is a free variable. (term_typing:var/1)
• The following properties should hold upon exit: +Edges is a list of triples. (basic_props:list/2) -(LGraph) is a labeled graph of term terms. (lgraphs:lgraph/2)

Documentation on internals (graphs)

REGTYPE: pair/1:

Usage: pair(P)

• Description: P is a pair (_,_).

REGTYPE: triple/1:

Usage: triple(P)

• Description: P is a triple (_,_,_).

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