Collaboration diagram for Graph Structures:
![]() |
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 | |
Wrapper Classes for Graphs | |
This group contains several wrapper classes for graphs. | |
Classes | |
class | FullGraph |
A full graph class. More... | |
class | ListGraph |
A list graph class. More... | |
class | UndirListGraph |
An undirected list graph class. More... | |
class | SmartGraph |
A smart graph class. More... | |
class | UndirSmartGraph |
A smart undirected graph class. More... |