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
 Implementation helper files.
directory  concepts

Files

file  base.cc
 Some basic non inline function and static global data.
file  bellman_ford.h
 BellmanFord algorithm.
file  bfs.h
 Bfs algorithm.
file  bin_heap.h
 Binary Heap implementation.
file  bipartite_matching.h
 Maximum matching algorithms in bipartite graphs.
file  bpugraph_adaptor.h
 Several graph adaptors.
file  bucket_heap.h
 Bucket Heap implementation.
file  color.cc
 Color constants.
file  color.h
 Tools to manage RGB colors.
file  concept_check.h
file  config.h
file  counter.h
 Tools for counting steps and events.
file  dag_shortest_path.h
 DagShortestPath algorithm.
file  dfs.h
 Dfs algorithm.
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
 EdgeSet classes.
file  edmonds_karp.h
 Implementation of the Edmonds-Karp algorithm.
file  eps.cc
file  eps.h
 Simple tool to create .eps files.
file  error.h
 Basic exception classes and error handling.
file  euler.h
 Euler tour.
file  fib_heap.h
 Fibonacci Heap implementation.
file  floyd_warshall.h
 FloydWarshall algorithm.
file  fredman_tarjan.h
 FredmanTarjan algorithm to compute minimum spanning forest.
file  full_graph.h
 FullGraph and FullUGraph classes.
file  graph_adaptor.h
 Several graph adaptors.
file  graph_reader.h
 Lemon Graph Format reader.
file  graph_to_eps.h
 Simple graph drawer.
file  graph_utils.h
 Graph utilities.
file  graph_writer.h
 Lemon Graph Format writer.
file  grid_ugraph.h
 GridUGraph class.
file  hao_orlin.h
 Implementation of the Hao-Orlin algorithm.
file  hypercube_graph.h
 HyperCubeGraph class.
file  iterable_maps.h
 Maps that makes it possible to iterate through the keys having a certain value.
file  johnson.h
 Johnson algorithm.
file  kruskal.h
 Kruskal's algorithm to compute a minimum cost tree.
file  lemon_reader.h
 Lemon Format reader.
file  lemon_writer.h
 Lemon Format writer.
file  list_graph.h
 ListGraph, ListUGraph 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_cplex.cc
 Implementation of the LEMON-CPLEX lp solver interface.
file  lp_cplex.h
 Header of the LEMON-CPLEX lp solver interface.
file  lp_glpk.cc
 Implementation of the LEMON-GLPK lp solver interface.
file  lp_glpk.h
 Header of the LEMON-GLPK lp solver interface.
file  lp_skeleton.cc
 A skeleton file to implement LP solver interfaces.
file  lp_skeleton.h
 A skeleton file to implement LP solver interfaces.
file  map_iterator.h
 Iterators on the maps.
file  maps.h
 Miscellaneous property maps.
file  matrix_maps.h
 Maps indexed with pairs of items.
file  max_matching.h
 Maximum matching algorithm in undirected graph.
file  min_cost_arborescence.h
 Minimum Cost Arborescence algorithm.
file  min_cut.h
 Maximum cardinality search and min cut in undirected graphs.
file  mip_cplex.cc
 Implementation of the LEMON-CPLEX mip solver interface.
file  mip_cplex.h
 Header of the LEMON-CPLEX mip solver interface.
file  mip_glpk.cc
 Implementation of the LEMON-GLPK mip solver interface.
file  mip_glpk.h
 Header of the LEMON-GLPK mip solver interface.
file  path.h
 Classes for representing paths in graphs.
file  polynomial.h
 A simple class implementing polynomials.
file  preflow.h
 Implementation of the preflow algorithm.
file  prim.h
 Prim algorithm to compute minimum spanning tree.
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  refptr.h
 A reference counted pointer implementation.
file  simann.h
 Simulated annealing framework.
file  smart_graph.h
 SmartGraph and SmartUGraph classes.
file  ssp_min_cost_flow.h
file  sub_graph.h
 Subgraphs.
file  suurballe.h
 An algorithm for finding k paths of minimal total length.
file  tabu_search.h
 TabuSearch algorithm.
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  topology.h
 Topology related algorithms.
file  ugraph_adaptor.h
 Several graph adaptors.
file  unionfind.h
 Union-Find data structures.
file  vmap.h
 Virtual map support.


Generated on Tue Oct 31 09:51:51 2006 for LEMON by  doxygen 1.5.1