- Main Page
- Modules
- Classes
- Namespaces
- Files
- Related Pages

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
lemon Directory Reference

## Detailed Description

This is the base directory of LEMON includes, so each include file must be prefixed with this, e.g.

#include<lemon/list_graph.h>
#include<lemon/dijkstra.h>

## Directories
directory | bits
| Auxiliary tools for implementation.
directory | concepts
| Concept descriptors and checking classes.

## Files
file | adaptors.h
| Adaptor classes for digraphs and graphs.
file | arg_parser.cc
file | arg_parser.h
| A tool to parse command line arguments.
file | assert.h
| Extended assertion handling.
file | base.cc
| Some basic non-inline functions and static global data.
file | bellman_ford.h
| Bellman-Ford algorithm.
file | bfs.h
| BFS algorithm.
file | bin_heap.h
| Binary heap implementation.
file | binomial_heap.h
| Binomial Heap implementation.
file | bucket_heap.h
| Bucket heap implementation.
file | capacity_scaling.h
| Capacity Scaling algorithm for finding a minimum cost flow.
file | cbc.cc
| Implementation of the CBC MIP solver interface.
file | cbc.h
| Header of the LEMON-CBC mip solver interface.
file | christofides_tsp.h
| Christofides algorithm for symmetric TSP.
file | circulation.h
| Push-relabel algorithm for finding a feasible circulation.
file | clp.cc
file | clp.h
| Header of the LEMON-CLP lp solver interface.
file | color.cc
| Color constants.
file | color.h
| Tools to manage RGB colors.
file | concept_check.h
| Basic utilities for concept checking.
file | connectivity.h
| Connectivity algorithms.
file | core.h
| LEMON core utilities.
file | cost_scaling.h
| Cost scaling algorithm for finding a minimum cost flow.
file | counter.h
| Tools for counting steps and events.
file | cplex.cc
| Implementation of the LEMON-CPLEX lp solver interface.
file | cplex.h
| Header of the LEMON-CPLEX lp solver interface.
file | cycle_canceling.h
| Cycle-canceling algorithms for finding a minimum cost flow.
file | dfs.h
| DFS algorithm.
file | dheap.h
| D-ary heap implementation.
file | dijkstra.h
| Dijkstra algorithm.
file | dim2.h
| A simple two dimensional vector and a bounding box implementation.
file | dimacs.h
| DIMACS file format reader.
file | edge_set.h
| ArcSet and EdgeSet classes.
file | edmonds_karp.h
| Implementation of the Edmonds-Karp algorithm.
file | elevator.h
| Elevator class.
file | error.h
| Basic exception classes and error handling.
file | euler.h
| Euler tour iterators and a function for checking the Eulerian property.
file | fib_heap.h
| Fibonacci heap implementation.
file | fractional_matching.h
| Fractional matching algorithms in general graphs.
file | full_graph.h
| FullDigraph and FullGraph classes.
file | glpk.cc
| Implementation of the LEMON GLPK LP and MIP solver interface.
file | glpk.h
| Header of the LEMON-GLPK lp solver interface.
file | gomory_hu.h
| Gomory-Hu cut tree in graphs.
file | graph_to_eps.h
| A well configurable tool for visualizing graphs.
file | greedy_tsp.h
| Greedy algorithm for symmetric TSP.
file | grid_graph.h
| GridGraph class.
file | grosso_locatelli_pullan_mc.h
| The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
file | hao_orlin.h
| Implementation of the Hao-Orlin algorithm.
file | hartmann_orlin_mmc.h
| Hartmann-Orlin's algorithm for finding a minimum mean cycle.
file | howard_mmc.h
| Howard's algorithm for finding a minimum mean cycle.
file | hypercube_graph.h
| HypercubeGraph class.
file | insertion_tsp.h
| Insertion algorithm for symmetric TSP.
file | karp_mmc.h
| Karp's algorithm for finding a minimum mean cycle.
file | kruskal.h
| Kruskal's algorithm to compute a minimum cost spanning tree.
file | lgf_reader.h
| LEMON Graph Format reader.
file | lgf_writer.h
| LEMON Graph Format writer.
file | list_graph.h
| ListDigraph and ListGraph classes.
file | lp.h
| Defines a default LP solver.
file | lp_base.cc
| The implementation of the LP solver interface.
file | lp_base.h
| The interface of the LP solver interface.
file | lp_skeleton.cc
| A skeleton file to implement LP solver interfaces.
file | lp_skeleton.h
| Skeleton file to implement LP/MIP solver interfaces.
file | maps.h
| Miscellaneous property maps.
file | matching.h
| Maximum matching algorithms in general graphs.
file | math.h
| Some extensions to the standard `cmath` library.
file | max_cardinality_search.h
| Maximum cardinality search in undirected digraphs.
file | min_cost_arborescence.h
| Minimum Cost Arborescence algorithm.
file | nagamochi_ibaraki.h
| Implementation of the Nagamochi-Ibaraki algorithm.
file | nauty_reader.h
| Nauty file reader.
file | nearest_neighbor_tsp.h
| Nearest neighbor algorithm for symmetric TSP.
file | network_simplex.h
| Network Simplex algorithm for finding a minimum cost flow.
file | opt2_tsp.h
| 2-opt algorithm for symmetric TSP.
file | pairing_heap.h
| Pairing heap implementation.
file | path.h
| Classes for representing paths in digraphs.
file | planarity.h
| Planarity checking, embedding, drawing and coloring.
file | preflow.h
| Implementation of the preflow algorithm.
file | quad_heap.h
| Fourary (quaternary) heap implementation.
file | radix_heap.h
| Radix heap implementation.
file | radix_sort.h
| Radix sort.
file | random.cc
| Instantiation of the Random class.
file | random.h
| Mersenne Twister random number generator.
file | smart_graph.h
| SmartDigraph and SmartGraph classes.
file | soplex.cc
| Implementation of the LEMON-SOPLEX lp solver interface.
file | soplex.h
| Header of the LEMON-SOPLEX lp solver interface.
file | static_graph.h
| StaticDigraph class.
file | suurballe.h
| An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
file | time_measure.h
| Tools for measuring cpu usage.
file | tolerance.h
| A basic tool to handle the anomalies of calculation with floating point numbers.
file | unionfind.h
| Union-Find data structures.