demo Directory Reference
Detailed Description
This directory contains several simple demo application, mainly for educational purposes.
Files | |
| file | arg_parser_demo.cc |
| Argument parser demo. | |
| file | circulation_demo.cc |
| Demonstrating the usage of LEMON's General Flow algorithm. | |
| file | coloring.cc |
| Coloring of a graph. | |
| file | csp_demo.cc |
| Demonstrating the usage of LEMON's algorithm for solving the Constrained shortest Path Problem. | |
| 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_dot.cc |
| Dim (DIMACS) to Dot (Graphviz) converter. | |
| 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_orientation.cc |
| Graph orientation with lower bound requirement on the in-degree of the nodes. | |
| 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 | maps_summary.cc |
| An introduction to LEMON maps. | |
| file | min_route.cc |
| Minimal route on a planar graph with eucledian distances. | |
| file | mip_demo.cc |
| Mixed integer program solver demo. | |
| file | reader_writer_demo.cc |
| Demonstrating graph input and output. | |
| file | sat-2.cc |
| Solver for SAT-2 problems. | |
| file | sat.cc |
| Solver for SAT problems. | |
| file | simann_maxcut_demo.cc |
| A program demonstrating the simulated annealing algorithm class. | |
| file | steiner_demo.cc |
| Calculating an approximate Steiner-tree. | |
| file | strongly_connected_orientation.cc |
| Strongly connected orientation. | |
| file | sub_graph_adaptor_demo.cc |
| Computing maximum number of edge-disjoint shortest paths. | |
| file | tight_edge_filter_map.h |
| Tight edge filter map. | |
| file | topological_ordering.cc |
| Demonstrating the Dfs class with topological ordering. | |
| file | topology_demo.cc |
| Demo what shows the result of some topology functions. | |
