|  Data Structures | |
|   Graph Structures | Graph structures implemented in LEMON | 
|    Adaptor Classes for Graphs | Adaptor classes for digraphs and graphs | 
|   Maps | Map structures implemented in LEMON | 
|    Graph Maps | Special graph-related maps | 
|    Map Adaptors | Tools to create new maps from existing ones | 
|   Path Structures | Path structures implemented in LEMON | 
|   Heap Structures | Heap structures implemented in LEMON | 
|   Auxiliary Data Structures | Auxiliary data structures implemented in LEMON | 
|    Geometric Data Structures | Geometric data structures implemented in LEMON | 
|  Algorithms | This group contains the several algorithms implemented in LEMON | 
|   Graph Search | Common graph search algorithms | 
|   Shortest Path Algorithms | Algorithms for finding shortest paths | 
|   Minimum Spanning Tree Algorithms | Algorithms for finding minimum cost spanning trees and arborescences | 
|   Maximum Flow Algorithms | Algorithms for finding maximum flows | 
|   Minimum Cost Flow Algorithms | Algorithms for finding minimum cost flows and circulations | 
|   Minimum Cut Algorithms | Algorithms for finding minimum cut in graphs | 
|   Minimum Mean Cycle Algorithms | Algorithms for finding minimum mean cycles | 
|   Matching Algorithms | Algorithms for finding matchings in graphs and bipartite graphs | 
|   Connectivity and Other Graph Properties | Algorithms for discovering the graph properties | 
|   Planar Embedding and Drawing | Algorithms for planarity checking, embedding and drawing | 
|   Traveling Salesman Problem | Algorithms for the symmetric traveling salesman problem | 
|   Approximation Algorithms | Approximation algorithms | 
|   Auxiliary Algorithms | Auxiliary algorithms implemented in LEMON | 
|  General Optimization Tools | This group contains some general optimization frameworks implemented in LEMON | 
|   LP and MIP Solvers | LP and MIP solver interfaces for LEMON | 
|  Tools and Utilities | Tools and utilities for programming in LEMON | 
|   Basic Graph Utilities | Simple basic graph utilities | 
|   Miscellaneous Tools | Tools for development, debugging and testing | 
|    Time Measuring and Counting | Simple tools for measuring the performance of algorithms | 
|   Exceptions | Exceptions defined in LEMON | 
|  Input-Output | Graph Input-Output methods | 
|   LEMON Graph Format | Reading and writing LEMON Graph Format | 
|   Postscript Exporting | General EPSdrawer and graph exporter | 
|   DIMACS Format | Read and write files in DIMACS format | 
|   NAUTY Format | Read Nauty format | 
|  Concepts | Skeleton classes and concept checking classes | 
|   Graph Structure Concepts | Skeleton and concept checking classes for graph structures | 
|   Map Concepts | Skeleton and concept checking classes for maps | 
|  Standalone Utility Applications | |
|  Demo Programs | 
 1.8.5
 1.8.5