☰

*ON THIS PAGE*# Labeled graph-processing utilities

**Author(s):** Francisco Bueno.## Usage and interface

## Documentation on exports

*Meta-predicate* with arguments: `lgraph(pred(1),?)`.

`vertices_edges_to_lgraph(Vertices0,Edges,Graph)`
## Documentation on imports

This module has the following direct dependencies:

See the comments for the `ugraphs` library.

**Library usage:**`:- use_module(library(graphs/lgraphs)).`**Exports:***Predicates:*`vertices_edges_to_lgraph/3`.*Regular Types:*`lgraph/2`.

REGTYPElgraph/2

Usage:`lgraph(Type,Graph)`

Graph is a labeled graph of Type terms.

PREDICATEvertices_edges_to_lgraph/3

This one is a copy of the same procedure in library(wgraphs) except for the definition of min/3 (ah! - the polimorphism!).

It would only be needed if there are multi-edges, i.e., several edges between the same two vertices.

*System library modules:*`sort`,`sets`.*Packages:*`prelude`,`initial`,`condcomp`,`assertions`,`assertions/assertions_basic`,`isomodes`,`regtypes`.

Generated with LPdoc using Ciao