| Graph structures implemented in LEMON | |
| Adaptor classes for digraphs and graphs | |
| Map structures implemented in LEMON | |
| Special graph-related maps | |
| Tools to create new maps from existing ones | |
| Path structures implemented in LEMON | |
| Heap structures implemented in LEMON | |
| Auxiliary data structures implemented in LEMON | |
| Geometric data structures implemented in LEMON | |
| This group contains the several algorithms implemented in LEMON | |
| Common graph search algorithms | |
| Algorithms for finding shortest paths | |
| Algorithms for finding minimum cost spanning trees and arborescences | |
| Algorithms for finding maximum flows | |
| Algorithms for finding minimum cost flows and circulations | |
| Algorithms for finding minimum cut in graphs | |
| Algorithms for finding minimum mean cycles | |
| Algorithms for finding matchings in graphs and bipartite graphs | |
| Algorithms for discovering the graph properties | |
| Algorithms for planarity checking, embedding and drawing | |
| Algorithms for the symmetric traveling salesman problem | |
| Approximation algorithms | |
| Auxiliary algorithms implemented in LEMON | |
| This group contains some general optimization frameworks implemented in LEMON | |
| LP and MIP solver interfaces for LEMON | |
| Tools and utilities for programming in LEMON | |
| Simple basic graph utilities | |
| Tools for development, debugging and testing | |
| Simple tools for measuring the performance of algorithms | |
| Exceptions defined in LEMON | |
| Graph Input-Output methods | |
| Reading and writing LEMON Graph Format | |
General EPS drawer and graph exporter | |
| Read and write files in DIMACS format | |
| Read Nauty format | |
| Skeleton classes and concept checking classes | |
| Skeleton and concept checking classes for graph structures | |
| Skeleton and concept checking classes for maps | |
1.8.5