PLEXUS is a library system that has been developed for the implementation of graph algorithms for certain graph grammars, see also [Wan88]. It supports the implementation of algorithms for graph grammars in that the embedding is done by a one to one iden- tification of special vertices. It provides a very comfortable data type for graphs of such graph models. Nevertheless, the major part of PLEXUS concerns usually defined graphs represented by adjacency lists. Graphs are allowed to be undirected, directed, or mixed, i.e., having directed and undirected edges. Hyperedges, multiple edges, ordered edges, and self-loops are also available. Terminal and nonterminal vertices could be equipped with geometrical positions and users specified informations.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.