LEMON also offers special graphs that cannot be used alone but only in conjunction with other graph representation. The examples for this are EdgeSet, NodeSet and the large variety of graph wrappers.
You are free to use the graph structure that fit your requirements the best, most graph algorithms and auxiliary data structures can be used with any graph structures.
Files | |
file | full_graph.h |
FullGraph and SymFullGraph classes. | |
file | list_graph.h |
ListGraph, SymListGraph, NodeSet and EdgeSet classes. | |
file | smart_graph.h |
SmartGraph and SymSmartGraph classes. | |
Modules | |
group | Wrapper Classes for Graphs |
This group contains several wrapper classes for graphs. | |
Classes | |
class | FullGraph |
A full graph class. More... | |
class | BidirGraph |
A bidirected graph template. More... | |
class | ListGraph |
A list graph class. More... | |
class | SymListGraph |
Graph for bidirectional edges. More... | |
class | NodeSet |
A graph class containing only nodes. More... | |
class | EdgeSet |
Graph structure using a node set of another graph. More... | |
class | SmartGraph |
A smart graph class. More... | |
class | SymSmartGraph |
Graph for bidirectional edges. More... |