Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related 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>

lemon/


Directories

directory  concept
 Concept descriptors and checking classes.

Files

file  alteration_notifier.h [code]
 Observer registry for graph alteration observers.
file  array_map.h [code]
 Graph maps that construates and destruates their elements dynamically.
file  bezier.h [code]
 Classes to compute with Bezier curves.
file  bfs.h [code]
 Bfs algorithm.
file  bin_heap.h [code]
 Binary Heap implementation.
file  clearable_graph_extender.h [code]
file  concept_check.h [code]
file  default_map.h [code]
 Graph maps that construct and destruct their elements dynamically.
file  dfs.h [code]
 DFS algorithm.
file  dijkstra.h [code]
 Dijkstra algorithm.
file  dimacs.h [code]
 Dimacs file format reader.
file  erasable_graph_extender.h [code]
file  error.h [code]
 Basic exception classes and error handling.
file  extendable_graph_extender.h [code]
file  extended_pair.h [code]
file  fib_heap.h [code]
 Fibonacci Heap implementation.
file  full_graph.h [code]
 FullGraph and SymFullGraph classes.
file  graph_reader.h [code]
 Graph reader.
file  graph_to_eps.h [code]
 Simple graph drawer.
file  graph_utils.h [code]
 Graph utilities.
file  graph_wrapper.h [code]
 Several graph wrappers.
file  graph_writer.h [code]
 Graph writer.
file  invalid.h [code]
 Definition of INVALID.
file  iterable_graph_extender.h [code]
file  kruskal.h [code]
 Kruskal's algorithm to compute a minimum cost tree.
file  list_graph.h [code]
 ListGraph, SymListGraph, NodeSet and EdgeSet classes.
file  map_iterator.h [code]
 Iterators on the maps.
file  map_utils.h [code]
 Map utilities.
file  maps.h [code]
 Miscellaneous property maps.
file  max_matching.h [code]
 Maximum matching algorithm.
file  min_cost_flow.h [code]
 An algorithm for finding a flow of value k (for small values of k) having minimal total cost.
file  path.h [code]
 Classes for representing paths in graphs.
file  preflow.h [code]
file  smart_graph.h [code]
 SmartGraph and SymSmartGraph classes.
file  suurballe.h [code]
 An algorithm for finding k paths of minimal total length.
file  time_measure.h [code]
 Tools for measuring cpu usage.
file  undir_graph_extender.h [code]
file  unionfind.h [code]
 Union-Find data structures.
file  utility.h [code]
file  vector_map.h [code]
 Vector based graph maps.
file  xy.h [code]
 A simple two dimensional vector and a bounding box implementation.

Generated on Sat Mar 19 10:58:47 2005 for LEMON by  doxygen 1.4.1