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 | dijkstra_demo.cc |
Demonstrating the usage of LEMON's Dijkstra algorithm. | |
file | dim_to_lgf.cc |
DIMACS to LGF converter (demo). | |
file | graph_to_eps_demo.cc |
Demo of the graph grawing function graphToEps(). | |
file | grid_graph_demo.cc |
Labirinth example with grid graph. | |
file | hello_lemon.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 plan 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 | sub_graph_adaptor_demo.cc |
Computing maximum number of edge-disjoint shortest paths. | |
file | topology_demo.cc |
Demo what shows the result of some topology functions. |