demo/coloring.cc | Coloring of a graph |
demo/dijkstra_demo.cc | Demonstrating the usage of LEMON's Dijkstra algorithm |
demo/dim_to_lgf.cc | DIMACS to LGF converter (demo) |
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_graph_demo.cc | Labirinth example with grid graph |
demo/hello_lemon.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/min_route.cc | Minimal route on a plan graph with eucledian distances |
demo/reader_writer_demo.cc | Demonstrating graph input and output |
demo/simann_maxcut_demo.cc | A program demonstrating the simulated annealing algorithm class |
demo/sub_graph_adaptor_demo.cc | Computing maximum number of edge-disjoint shortest paths |
demo/tight_edge_filter_map.h [code] | |
demo/topology_demo.cc | Demo what shows the result of some topology functions |
doc/template.h [code] | |
lemon/base.cc | Some basic non inline function and static global data |
lemon/bellman_ford.h [code] | BellmanFord algorithm |
lemon/bezier.h [code] | Classes to compute with Bezier curves |
lemon/bfs.h [code] | Bfs algorithm |
lemon/bin_heap.h [code] | Binary Heap implementation |
lemon/concept_check.h [code] | |
lemon/config.h [code] | |
lemon/counter.h [code] | Tools for counting steps and events |
lemon/dag_shortest_path.h [code] | DagShortestPath algorithm |
lemon/dfs.h [code] | Dfs algorithm |
lemon/dijkstra.h [code] | Dijkstra algorithm |
lemon/dimacs.h [code] | Dimacs file format reader |
lemon/edge_set.h [code] | EdgeSet classes |
lemon/error.h [code] | Basic exception classes and error handling |
lemon/euler.h [code] | Euler tour |
lemon/fib_heap.h [code] | Fibonacci Heap implementation |
lemon/floyd_warshall.h [code] | FloydWarshall algorithm |
lemon/fredman_tarjan.h [code] | FredmanTarjan algorithm to compute minimum spanning forest |
lemon/full_graph.h [code] | FullGraph and FullUGraph classes |
lemon/graph_adaptor.h [code] | Several graph adaptors |
lemon/graph_reader.h [code] | Lemon Graph Format reader |
lemon/graph_to_eps.h [code] | Simple graph drawer |
lemon/graph_utils.h [code] | Graph utilities |
lemon/graph_writer.h [code] | Lemon Graph Format writer |
lemon/grid_graph.h [code] | GridGraph class |
lemon/hypercube_graph.h [code] | HyperCubeGraph class |
lemon/invalid.h [code] | Definition of INVALID |
lemon/iterable_maps.h [code] | Maps that makes it possible to iterate through the keys having a certain value |
lemon/johnson.h [code] | Johnson algorithm |
lemon/kruskal.h [code] | Kruskal's algorithm to compute a minimum cost tree |
lemon/lemon_reader.h [code] | Lemon Format reader |
lemon/lemon_writer.h [code] | Lemon Format writer |
lemon/linear_heap.h [code] | Binary Heap implementation |
lemon/list_graph.h [code] | ListGraph, ListUGraph classes |
lemon/lp.h [code] | Defines a default LP solver |
lemon/lp_base.cc | The implementation of the LP solver interface |
lemon/lp_base.h [code] | The interface of the LP solver interface |
lemon/lp_cplex.cc | Implementation of the LEMON-CPLEX lp solver interface |
lemon/lp_cplex.h [code] | Header of the LEMON-CPLEX lp solver interface |
lemon/lp_glpk.cc | Implementation of the LEMON-GLPK lp solver interface |
lemon/lp_glpk.h [code] | Header of the LEMON-GLPK lp solver interface |
lemon/lp_skeleton.cc | A skeleton file to implement LP solver interfaces |
lemon/lp_skeleton.h [code] | A skeleton file to implement LP solver interfaces |
lemon/map_iterator.h [code] | Iterators on the maps |
lemon/maps.h [code] | Miscellaneous property maps |
lemon/matrix_maps.h [code] | Maps indexed with pairs of items |
lemon/max_matching.h [code] | Maximum matching algorithm |
lemon/min_cost_flow.h [code] | An algorithm for finding a flow of value k (for small values of k ) having minimal total cost |
lemon/path.h [code] | Classes for representing paths in graphs |
lemon/preflow.h [code] | Implementation of the preflow algorithm |
lemon/prim.h [code] | Prim algorithm to compute minimum spanning tree |
lemon/radix_heap.h [code] | Radix Heap implementation |
lemon/radix_sort.h [code] | Radix sort |
lemon/simann.h [code] | Simulated annealing framework |
lemon/smart_graph.h [code] | SmartGraph and SmartUGraph classes |
lemon/sub_graph.h [code] | |
lemon/suurballe.h [code] | An algorithm for finding k paths of minimal total length |
lemon/time_measure.h [code] | Tools for measuring cpu usage |
lemon/tolerance.h [code] | A basic tool to handle the anomalies of calculation with floating point numbers |
lemon/topology.h [code] | Topology related algorithms |
lemon/traits.h [code] | Traits for graphs and maps |
lemon/unionfind.h [code] | Union-Find data structures |
lemon/utility.h [code] | Miscellaneous basic utilities |
lemon/xy.h [code] | A simple two dimensional vector and a bounding box implementation |
lemon/bits/alteration_notifier.h [code] | Observer registry for graph alteration observers |
lemon/bits/array_map.h [code] | Graph maps that construct and destruct their elements dynamically |
lemon/bits/clearable_graph_extender.h [code] | |
lemon/bits/default_map.h [code] | Graph maps that construct and destruct their elements dynamically |
lemon/bits/erasable_graph_extender.h [code] | |
lemon/bits/extendable_graph_extender.h [code] | |
lemon/bits/graph_extender.h [code] | |
lemon/bits/item_reader.h [code] | Item Readers and WritersItem reader bits for lemon input |
lemon/bits/item_writer.h [code] | Item writer bits for lemon output |
lemon/bits/iterable_graph_extender.h [code] | |
lemon/bits/map_extender.h [code] | Extenders for iterable maps |
lemon/bits/static_map.h [code] | Static sized graph maps |
lemon/bits/vector_map.h [code] | Vector based graph maps |
lemon/concept/bpugraph.h [code] | Undirected bipartite graphs and components of |
lemon/concept/graph.h [code] | Declaration of Graph |
lemon/concept/graph_component.h [code] | The graph components |
lemon/concept/heap.h [code] | Classes for representing heaps |
lemon/concept/maps.h [code] | Map concepts checking classes for testing and documenting |
lemon/concept/matrix_maps.h [code] | MatrixMap concepts checking classes for testing and documenting |
lemon/concept/path.h [code] | Classes for representing paths in graphs |
lemon/concept/ugraph.h [code] | Undirected graphs and components of |
test/test_tools.h [code] | Some utilities to write test programs |