demo/arg_parser_demo.cc | Argument parser demo |

demo/circulation_demo.cc | Demonstrating the usage of LEMON's General Flow algorithm |

demo/coloring.cc | Coloring of a graph |

demo/csp_demo.cc | Demonstrating the usage of LEMON's algorithm for solving the Constrained shortest Path Problem |

demo/descriptor_map_demo.cc | Using descriptor map and own special map types |

demo/dijkstra_demo.cc | Demonstrating the usage of LEMON's Dijkstra algorithm |

demo/dim_to_dot.cc | Dim (DIMACS) to Dot (Graphviz) converter |

demo/disjoint_paths_demo.cc | Node and edge disjoint paths in directed graph |

demo/eps_demo.cc | Demo of the EPS grawing class EpsDrawer |

demo/graph_orientation.cc | Graph orientation with lower bound requirement on the in-degree of the nodes |

demo/graph_to_eps_demo.cc | Demo of the graph grawing function graphToEps() |

demo/grid_ugraph_demo.cc | Labirinth example with grid ugraph |

demo/hello_lemon.cc | LEMON style "Hello World!" program |

demo/hello_world.cc | LEMON style "Hello World!" program |

demo/kruskal_demo.cc | Minimum weight spanning tree by Kruskal algorithm (demo) |

demo/lp_demo.cc | A program demonstrating the LEMON LP solver interface |

demo/lp_maxflow_demo.cc | Max flow problem solved with an LP solver (demo) |

demo/maps_summary.cc | An introduction to LEMON maps |

demo/min_route.cc | Minimal route on a planar graph with eucledian distances |

demo/mip_demo.cc | Mixed integer program solver demo |

demo/reader_writer_demo.cc | Demonstrating graph input and output |

demo/sat-2.cc | Solver for SAT-2 problems |

demo/sat.cc | Solver for SAT problems |

demo/simann_maxcut_demo.cc | A program demonstrating the simulated annealing algorithm class |

demo/steiner_demo.cc | Calculating an approximate Steiner-tree |

demo/strongly_connected_orientation.cc | Strongly connected orientation |

demo/sub_graph_adaptor_demo.cc | Computing maximum number of edge-disjoint shortest paths |

demo/tight_edge_filter_map.h | Tight edge filter map |

demo/topological_ordering.cc | Demonstrating the Dfs class with topological ordering |

demo/topology_demo.cc | Demo what shows the result of some topology functions |

lemon/arg_parser.h | A tools to parse command line arguments |

lemon/base.cc | Some basic non inline function and static global data |

lemon/bellman_ford.h | BellmanFord algorithm |

lemon/bfs.h | Bfs algorithm |

lemon/bin_heap.h | Binary Heap implementation |

lemon/bipartite_matching.h | Maximum matching algorithms in bipartite graphs |

lemon/bpugraph_adaptor.h | Several graph adaptors |

lemon/bucket_heap.h | Bucket Heap implementation |

lemon/cancel_and_tighten.h | Cancel and Tighten algorithm for finding a minimum cost flow |

lemon/capacity_scaling.h | Capacity scaling algorithm for finding a minimum cost flow |

lemon/circulation.h | Push-prelabel algorithm for finding a feasible circulation |

lemon/color.cc | Color constants |

lemon/color.h | Tools to manage RGB colors |

lemon/cost_scaling.h | Cost scaling algorithm for finding a minimum cost flow |

lemon/counter.h | Tools for counting steps and events |

lemon/csp.h | Algorithm for the Resource Constrained Shortest Path problem |

lemon/cycle_canceling.h | Cycle-canceling algorithm for finding a minimum cost flow |

lemon/dag_shortest_path.h | DagShortestPath algorithm |

lemon/dfs.h | Dfs algorithm |

lemon/dijkstra.h | Dijkstra algorithm |

lemon/dim2.h | A simple two dimensional vector and a bounding box implementation |

lemon/dimacs.h | DIMACS file format reader |

lemon/dinitz_sleator_tarjan.h | Implementation the dynamic tree data structure of Sleator and Tarjan |

lemon/dist_log.h | Measure a Distribution |

lemon/dynamic_tree.h | The dynamic tree data structure of Sleator and Tarjan |

lemon/edge_set.h | EdgeSet classes |

lemon/edmonds_karp.h | Implementation of the Edmonds-Karp algorithm |

lemon/elevator.h | Elevator class |

lemon/eps.h | Simple tool to create .eps files |

lemon/error.h | Basic exception classes and error handling |

lemon/euler.h | Euler tour |

lemon/fib_heap.h | Fibonacci Heap implementation |

lemon/floyd_warshall.h | FloydWarshall algorithm |

lemon/fredman_tarjan.h | FredmanTarjan algorithm to compute minimum spanning forest |

lemon/full_graph.h | FullGraph and FullUGraph classes |

lemon/goldberg_tarjan.h | Implementation of the preflow algorithm |

lemon/gomory_hu_tree.h | Gomory-Hu cut tree in undirected graphs |

lemon/graph_adaptor.h | Several graph adaptors |

lemon/graph_reader.h | Lemon Graph Format reader |

lemon/graph_to_eps.h | Simple graph drawer |

lemon/graph_utils.h | Graph utilities |

lemon/graph_writer.h | Lemon Graph Format writer |

lemon/grid_ugraph.h | GridUGraph class |

lemon/hao_orlin.h | Implementation of the Hao-Orlin algorithm |

lemon/hypercube_graph.h | HyperCubeGraph class |

lemon/iterable_maps.h | Maps that makes it possible to iterate through the keys having a certain value |

lemon/johnson.h | Johnson algorithm |

lemon/kruskal.h | |

lemon/lemon_reader.h | Lemon Format reader |

lemon/lemon_writer.h | Lemon Format writer |

lemon/list_graph.h | ListGraph, ListUGraph classes |

lemon/lp.h | Defines a default LP solver |

lemon/lp_base.cc | The implementation of the LP solver interface |

lemon/lp_base.h | The interface of the LP solver interface |

lemon/lp_cplex.cc | Implementation of the LEMON-CPLEX lp solver interface |

lemon/lp_cplex.h | Header of the LEMON-CPLEX lp solver interface |

lemon/lp_glpk.cc | Implementation of the LEMON-GLPK lp solver interface |

lemon/lp_glpk.h | Header of the LEMON-GLPK lp solver interface |

lemon/lp_skeleton.cc | A skeleton file to implement LP solver interfaces |

lemon/lp_skeleton.h | A skeleton file to implement LP solver interfaces |

lemon/lp_soplex.cc | Implementation of the LEMON-SOPLEX lp solver interface |

lemon/lp_soplex.h | Header of the LEMON-SOPLEX lp solver interface |

lemon/map_iterator.h | Iterators on the maps |

lemon/maps.h | Miscellaneous property maps |

lemon/math.h | Some extensions to the standard `cmath` library |

lemon/matrix_maps.h | Maps indexed with pairs of items |

lemon/max_matching.h | Maximum matching algorithms in undirected graph |

lemon/min_cost_arborescence.h | Minimum Cost Arborescence algorithm |

lemon/min_cost_flow.h | An efficient algorithm for finding a minimum cost flow |

lemon/min_cost_max_flow.h | An efficient algorithm for finding a minimum cost maximum flow |

lemon/min_mean_cycle.h | Howard's algorithm for finding a minimum mean directed cycle |

lemon/mip_cplex.cc | Implementation of the LEMON-CPLEX mip solver interface |

lemon/mip_cplex.h | Header of the LEMON-CPLEX mip solver interface |

lemon/mip_glpk.cc | Implementation of the LEMON-GLPK mip solver interface |

lemon/mip_glpk.h | Header of the LEMON-GLPK mip solver interface |

lemon/nagamochi_ibaraki.h | Maximum cardinality search and minimum cut in undirected graphs |

lemon/nauty_reader.h | Nauty file reader |

lemon/network_simplex.h | Network simplex algorithm for finding a minimum cost flow |

lemon/path.h | Classes for representing paths in graphs |

lemon/path_utils.h | Classes for representing paths in graphs |

lemon/planarity.h | Planarity checking, embedding, drawing and coloring |

lemon/polynomial.h | A simple class implementing polynomials |

lemon/pr_bipartite_matching.h | Push-prelabel maximum matching algorithms in bipartite graphs |

lemon/preflow.h | Implementation of the preflow algorithm |

lemon/prim.h | Prim algorithm to compute minimum spanning tree |

lemon/radix_heap.h | Radix Heap implementation |

lemon/radix_sort.h | Radix sort |

lemon/random.cc | Instantiation of the Random class |

lemon/random.h | Mersenne Twister random number generator |

lemon/refptr.h | A reference counted pointer implementation |

lemon/simann.h | Simulated annealing framework |

lemon/smart_graph.h | SmartGraph and SmartUGraph classes |

lemon/steiner.h | Algorithm for the 2-approximation of Steiner Tree problem |

lemon/sub_graph.h | Subgraphs |

lemon/suurballe.h | An algorithm for finding edge-disjoint paths between two nodes having minimum total length |

lemon/tabu_search.h | TabuSearch algorithm |

lemon/time_measure.h | Tools for measuring cpu usage |

lemon/tolerance.h | A basic tool to handle the anomalies of calculation with floating point numbers |

lemon/topology.h | Topology related algorithms |

lemon/ugraph_adaptor.h | Several graph adaptors |

lemon/unionfind.h | Union-Find data structures |

lemon/vmap.h | Virtual map support |

lemon/bits/alteration_notifier.h | Observer notifier for graph alteration observers |

lemon/bits/array_map.h | Graph map based on the array storage |

lemon/bits/base_extender.h | Extenders for the graph types |

lemon/bits/bezier.h | Classes to compute with Bezier curves |

lemon/bits/debug_map.h | Vector based graph maps for debugging |

lemon/bits/default_map.h | Graph maps that construct and destruct their elements dynamically |

lemon/bits/edge_set_extender.h | Extenders for the edge set types |

lemon/bits/graph_adaptor_extender.h | Extenders for the graph adaptor types |

lemon/bits/graph_extender.h | Extenders for the graph types |

lemon/bits/invalid.h | Definition of INVALID |

lemon/bits/item_reader.h | Item reader bits for lemon input |

lemon/bits/item_writer.h | Item writer bits for lemon output |

lemon/bits/map_extender.h | Extenders for iterable maps |

lemon/bits/traits.h | Traits for graphs and maps |

lemon/bits/utility.h | Miscellaneous basic utilities |

lemon/bits/variant.h | Variant types |

lemon/bits/vector_map.h | Vector based graph maps |

lemon/concepts/bpugraph.h | The concept of Bipartite Undirected Graphs |

lemon/concepts/graph.h | The concept of Directed Graphs |

lemon/concepts/graph_components.h | The concept of graph components |

lemon/concepts/heap.h | Classes for representing heaps |

lemon/concepts/maps.h | Map concepts checking classes for testing and documenting |

lemon/concepts/matrix_maps.h | MatrixMap concepts checking classes for testing and documenting |

lemon/concepts/path.h | Classes for representing paths in graphs |

lemon/concepts/ugraph.h | The concept of Undirected Graphs |

test/test_tools.h | Some utilities to write test programs |

tools/dim_to_lgf.cc | DIMACS to LGF converter |

tools/lgf-gen.cc | Special plane graph generator |

Generated on Thu Jun 4 04:06:57 2009 for LEMON by 1.5.9