| A collection of demo applications | |
| Argument parser demo | |
| Demo of the graph drawing function graphToEps() | |
| Demonstrating graph input and output | |
| Auxiliary (and the whole generated) documentation | |
| Base include directory of LEMON | |
| Auxiliary tools for implementation | |
| Some basic non-inline functions and static global data | |
| Concept descriptors and checking classes | |
| The concept of undirected graphs | |
| The concept of directed graphs | |
| The concept of undirected graphs | |
| The concepts of graph components | |
| The concept of heaps | |
| The concept of maps | |
| The concept of paths | |
| Adaptor classes for digraphs and graphs | |
| A tool to parse command line arguments | |
| Extended assertion handling | |
| Some basic non-inline functions and static global data | |
| Bellman-Ford algorithm | |
| BFS algorithm | |
| Binary heap implementation | |
| Binomial Heap implementation | |
| Bucket heap implementation | |
| Capacity Scaling algorithm for finding a minimum cost flow | |
| Implementation of the CBC MIP solver interface | |
| Header of the LEMON-CBC mip solver interface | |
| Christofides algorithm for symmetric TSP | |
| Push-relabel algorithm for finding a feasible circulation | |
| Header of the LEMON-CLP lp solver interface | |
| Color constants | |
| Tools to manage RGB colors | |
| Basic utilities for concept checking | |
| Connectivity algorithms | |
| LEMON core utilities | |
| Cost scaling algorithm for finding a minimum cost flow | |
| Tools for counting steps and events | |
| Implementation of the LEMON-CPLEX lp solver interface | |
| Header of the LEMON-CPLEX lp solver interface | |
| Cycle-canceling algorithms for finding a minimum cost flow | |
| DFS algorithm | |
| D-ary heap implementation | |
| Dijkstra algorithm | |
| A simple two dimensional vector and a bounding box implementation | |
| DIMACS file format reader | |
| ArcSet and EdgeSet classes | |
| Implementation of the Edmonds-Karp algorithm | |
| Elevator class | |
| Basic exception classes and error handling | |
| Euler tour iterators and a function for checking the Eulerian property | |
| Fibonacci heap implementation | |
| Fractional matching algorithms in general graphs | |
| FullDigraph and FullGraph classes | |
| Implementation of the LEMON GLPK LP and MIP solver interface | |
| Header of the LEMON-GLPK lp solver interface | |
| Gomory-Hu cut tree in graphs | |
| A well configurable tool for visualizing graphs | |
| Greedy algorithm for symmetric TSP | |
| GridGraph class | |
| The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem | |
| Implementation of the Hao-Orlin algorithm | |
| Hartmann-Orlin's algorithm for finding a minimum mean cycle | |
| Howard's algorithm for finding a minimum mean cycle | |
| HypercubeGraph class | |
| Insertion algorithm for symmetric TSP | |
| Karp's algorithm for finding a minimum mean cycle | |
| Kruskal's algorithm to compute a minimum cost spanning tree | |
| LEMON Graph Format reader | |
| LEMON Graph Format writer | |
| ListDigraph and ListGraph classes | |
| Defines a default LP solver | |
| The implementation of the LP solver interface | |
| The interface of the LP solver interface | |
| A skeleton file to implement LP solver interfaces | |
| Skeleton file to implement LP/MIP solver interfaces | |
| Miscellaneous property maps | |
| Maximum matching algorithms in general graphs | |
Some extensions to the standard cmath library | |
| Maximum cardinality search in undirected digraphs | |
| Minimum Cost Arborescence algorithm | |
| Implementation of the Nagamochi-Ibaraki algorithm | |
| Nauty file reader | |
| Nearest neighbor algorithm for symmetric TSP | |
| Network Simplex algorithm for finding a minimum cost flow | |
| 2-opt algorithm for symmetric TSP | |
| Pairing heap implementation | |
| Classes for representing paths in digraphs | |
| Planarity checking, embedding, drawing and coloring | |
| Implementation of the preflow algorithm | |
| Fourary (quaternary) heap implementation | |
| Radix heap implementation | |
| Radix sort | |
| Instantiation of the Random class | |
| Mersenne Twister random number generator | |
| SmartDigraph and SmartGraph classes | |
| Implementation of the LEMON-SOPLEX lp solver interface | |
| Header of the LEMON-SOPLEX lp solver interface | |
| StaticDigraph class | |
| An algorithm for finding arc-disjoint paths between two nodes having minimum total length | |
| Tools for measuring cpu usage | |
| A basic tool to handle the anomalies of calculation with floating point numbers | |
| Union-Find data structures | |
| Test programs | |
| Some utilities to write test programs | |
| Some useful executables | |
| DIMACS problem solver | |
| DIMACS to LGF converter | |
| Special plane graph generator |
1.8.5