  demo | A collection of demo applications |
   arg_parser_demo.cc | Argument parser demo |
| graph_to_eps_demo.cc | Demo of the graph drawing function graphToEps() |
 lgf_demo.cc | Demonstrating graph input and output |
| doc | Auxiliary (and the whole generated) documentation |
| lemon | Base include directory of LEMON |
| bits | Auxiliary tools for implementation |
| windows.cc | Some basic non-inline functions and static global data |
| concepts | Concept descriptors and checking classes |
| digraph.h | The concept of directed graphs |
| graph.h | The concept of undirected graphs |
| graph_components.h | The concepts of graph components |
| heap.h | The concept of heaps |
| maps.h | The concept of maps |
| path.h | The concept of paths |
| adaptors.h | Adaptor classes for digraphs and graphs |
| arg_parser.h | A tool to parse command line arguments |
| assert.h | Extended assertion handling |
| base.cc | Some basic non-inline functions and static global data |
| bellman_ford.h | Bellman-Ford algorithm |
| bfs.h | BFS algorithm |
| bin_heap.h | Binary heap implementation |
| binomial_heap.h | Binomial Heap implementation |
| bucket_heap.h | Bucket heap implementation |
| capacity_scaling.h | Capacity Scaling algorithm for finding a minimum cost flow |
| cbc.cc | Implementation of the CBC MIP solver interface |
| cbc.h | Header of the LEMON-CBC mip solver interface |
| circulation.h | Push-relabel algorithm for finding a feasible circulation |
| clp.h | Header of the LEMON-CLP lp solver interface |
| color.cc | Color constants |
| color.h | Tools to manage RGB colors |
| concept_check.h | Basic utilities for concept checking |
| connectivity.h | Connectivity algorithms |
| core.h | LEMON core utilities |
| cost_scaling.h | Cost scaling algorithm for finding a minimum cost flow |
| counter.h | Tools for counting steps and events |
| cplex.cc | Implementation of the LEMON-CPLEX lp solver interface |
| cplex.h | Header of the LEMON-CPLEX lp solver interface |
| cycle_canceling.h | Cycle-canceling algorithms for finding a minimum cost flow |
| dfs.h | DFS algorithm |
| dheap.h | D-ary heap implementation |
| dijkstra.h | Dijkstra algorithm |
| dim2.h | A simple two dimensional vector and a bounding box implementation |
| dimacs.h | DIMACS file format reader |
| edge_set.h | ArcSet and EdgeSet classes |
| elevator.h | Elevator class |
| error.h | Basic exception classes and error handling |
| euler.h | Euler tour iterators and a function for checking the Eulerian property |
| fib_heap.h | Fibonacci heap implementation |
| fractional_matching.h | Fractional matching algorithms in general graphs |
| full_graph.h | FullDigraph and FullGraph classes |
| glpk.cc | Implementation of the LEMON GLPK LP and MIP solver interface |
| glpk.h | Header of the LEMON-GLPK lp solver interface |
| gomory_hu.h | Gomory-Hu cut tree in graphs |
| graph_to_eps.h | A well configurable tool for visualizing graphs |
| grid_graph.h | GridGraph class |
| hao_orlin.h | Implementation of the Hao-Orlin algorithm |
| hartmann_orlin_mmc.h | Hartmann-Orlin's algorithm for finding a minimum mean cycle |
| howard_mmc.h | Howard's algorithm for finding a minimum mean cycle |
| hypercube_graph.h | HypercubeGraph class |
| karp_mmc.h | Karp's algorithm for finding a minimum mean cycle |
| kruskal.h | |
| lgf_reader.h | LEMON Graph Format reader |
| lgf_writer.h | LEMON Graph Format writer |
| list_graph.h | ListDigraph and ListGraph classes |
| lp.h | Defines a default LP solver |
| lp_base.cc | The implementation of the LP solver interface |
| lp_base.h | The interface of the LP solver interface |
| lp_skeleton.cc | A skeleton file to implement LP solver interfaces |
| lp_skeleton.h | Skeleton file to implement LP/MIP solver interfaces |
| maps.h | Miscellaneous property maps |
| matching.h | Maximum matching algorithms in general graphs |
| math.h | Some extensions to the standard cmath library |
| min_cost_arborescence.h | Minimum Cost Arborescence algorithm |
| nauty_reader.h | Nauty file reader |
| network_simplex.h | Network Simplex algorithm for finding a minimum cost flow |
| pairing_heap.h | Pairing heap implementation |
| path.h | Classes for representing paths in digraphs |
| planarity.h | Planarity checking, embedding, drawing and coloring |
| preflow.h | Implementation of the preflow algorithm |
| quad_heap.h | Fourary (quaternary) heap implementation |
| radix_heap.h | Radix heap implementation |
| radix_sort.h | Radix sort |
| random.cc | Instantiation of the Random class |
| random.h | Mersenne Twister random number generator |
| smart_graph.h | SmartDigraph and SmartGraph classes |
| soplex.cc | Implementation of the LEMON-SOPLEX lp solver interface |
| soplex.h | Header of the LEMON-SOPLEX lp solver interface |
| static_graph.h | StaticDigraph class |
| suurballe.h | An algorithm for finding arc-disjoint paths between two nodes having minimum total length |
| time_measure.h | Tools for measuring cpu usage |
| tolerance.h | A basic tool to handle the anomalies of calculation with floating point numbers |
| unionfind.h | Union-Find data structures |
| test | Test programs |
| test_tools.h | Some utilities to write test programs |
 tools | Some useful executables |
 dimacs-solver.cc | DIMACS problem solver |
| dimacs-to-lgf.cc | DIMACS to LGF converter |
| lgf-gen.cc | Special plane graph generator |
1.8.2
