LEMON 1.0.7
|
The implementation of combinatorial algorithms heavily relies on efficient graph implementations. LEMON offers data structures which are planned to be easily used in an experimental phase of implementation studies, and thereafter the program code can be made efficient by small modifications.
The most efficient implementation of diverse applications require the usage of different physical graph implementations. These differences appear in the size of graph we require to handle, memory or time usage limitations or in the set of operations through which the graph can be accessed. LEMON provides several physical graph structures to meet the diverging requirements of the possible users. In order to save on running time or on memory usage, some structures may fail to provide some graph features like arc/edge or node deletion.
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 structure.
See also: Graph Structure Concepts.
Classes | |
class | ListDigraph |
A general directed graph structure. More... | |
class | ListGraph |
A general undirected graph structure. More... | |
class | SmartDigraph |
A smart directed graph class. More... | |
class | SmartGraph |
A smart undirected graph class. More... | |
Files | |
file | list_graph.h |
ListDigraph, ListGraph classes. | |
file | smart_graph.h |
SmartDigraph and SmartGraph classes. |