Demo programs


Detailed Description

Some demo programs are listed here. Their full source codes can be found in the demo subdirectory of the source tree.

The standard compilation procedure (./configure;make) will compile them, as well.


Files

file  graph_orientation.cc
 Graph orientation with lower bound requirement on the in-degree of the nodes.
file  coloring.cc
 Coloring of a graph.
file  descriptor_map_demo.cc
 Using descriptor map and own special map types.
file  dijkstra_demo.cc
 Demonstrating the usage of LEMON's Dijkstra algorithm.
file  dim_to_lgf.cc
 DIMACS to LGF converter (demo).
file  disjoint_paths_demo.cc
 Node and edge disjoint paths in directed graph.
file  eps_demo.cc
 Demo of the EPS grawing class EpsDrawer().
file  graph_to_eps_demo.cc
 Demo of the graph grawing function graphToEps().
file  grid_ugraph_demo.cc
 Labirinth example with grid ugraph.
file  hello_lemon.cc
 LEMON style "Hello World!" program.
file  hello_world.cc
 LEMON style "Hello World!" program.
file  kruskal_demo.cc
 Minimum weight spanning tree by Kruskal algorithm (demo).
file  lp_demo.cc
 A program demonstrating the LEMON LP solver interface.
file  lp_maxflow_demo.cc
 Max flow problem solved with an LP solver (demo).
file  min_route.cc
 Minimal route on a planar graph with eucledian distances.
file  reader_writer_demo.cc
 Demonstrating graph input and output.
file  simann_maxcut_demo.cc
 A program demonstrating the simulated annealing algorithm class.
file  strongly_connected_orientation.cc
 Strongly connected orientation.
file  sub_graph_adaptor_demo.cc
 Computing maximum number of edge-disjoint shortest paths.
file  topological_ordering.cc
 Demonstrating the Dfs class with topological ordering.
file  topology_demo.cc
 Demo what shows the result of some topology functions.


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