My Project
Loading...
Searching...
No Matches
lemon Directory Reference

Detailed Description

This is the base directory of LEMON includes, so each include file must be prefixed with this, e.g.

#include<lemon/list_graph.h>
#include<lemon/dijkstra.h>

Directories

 bits
 Auxiliary tools for implementation.
 
 concepts
 Concept descriptors and checking classes.
 

Files

 adaptors.h
 Adaptor classes for digraphs and graphs.
 
 arg_parser.h
 
 assert.h
 Extended assertion handling.
 
 base.cc
 
 bellman_ford.h
 Bellman-Ford algorithm.
 
 bfs.h
 
 bin_heap.h
 
 binomial_heap.h
 
 bucket_heap.h
 
 capacity_scaling.h
 Capacity Scaling algorithm for finding a minimum cost flow.
 
 cbc.cc
 
 cbc.h
 
 christofides_tsp.h
 Christofides algorithm for symmetric TSP.
 
 circulation.h
 
 clp.h
 
 color.cc
 
 color.h
 
 concept_check.h
 
 connectivity.h
 Connectivity algorithms.
 
 core.h
 
 cost_scaling.h
 Cost scaling algorithm for finding a minimum cost flow.
 
 counter.h
 
 cplex.cc
 
 cplex.h
 
 cycle_canceling.h
 Cycle-canceling algorithms for finding a minimum cost flow.
 
 dfs.h
 
 dheap.h
 
 dijkstra.h
 
 dim2.h
 
 dimacs.h
 DIMACS file format reader.
 
 edge_set.h
 ArcSet and EdgeSet classes.
 
 edmonds_karp.h
 Implementation of the Edmonds-Karp algorithm.
 
 elevator.h
 
 error.h
 Basic exception classes and error handling.
 
 euler.h
 Euler tour iterators and a function for checking the Eulerian property.
 
 fib_heap.h
 
 fractional_matching.h
 
 full_graph.h
 
 glpk.cc
 
 glpk.h
 
 gomory_hu.h
 Gomory-Hu cut tree in graphs.
 
 graph_to_eps.h
 
 greedy_tsp.h
 Greedy algorithm for symmetric TSP.
 
 grid_graph.h
 
 grosso_locatelli_pullan_mc.h
 The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
 
 hao_orlin.h
 Implementation of the Hao-Orlin algorithm.
 
 hartmann_orlin_mmc.h
 Hartmann-Orlin's algorithm for finding a minimum mean cycle.
 
 howard_mmc.h
 Howard's algorithm for finding a minimum mean cycle.
 
 hypercube_graph.h
 
 insertion_tsp.h
 Insertion algorithm for symmetric TSP.
 
 karp_mmc.h
 Karp's algorithm for finding a minimum mean cycle.
 
 kruskal.h
 
 lgf_reader.h
 
 lgf_writer.h
 
 list_graph.h
 
 lp.h
 
 lp_base.cc
 
 lp_base.h
 
 lp_skeleton.cc
 
 lp_skeleton.h
 
 maps.h
 
 matching.h
 
 math.h
 
 max_cardinality_search.h
 Maximum cardinality search in undirected digraphs.
 
 min_cost_arborescence.h
 
 nagamochi_ibaraki.h
 Implementation of the Nagamochi-Ibaraki algorithm.
 
 nauty_reader.h
 Nauty file reader.
 
 nearest_neighbor_tsp.h
 Nearest neighbor algorithm for symmetric TSP.
 
 network_simplex.h
 Network Simplex algorithm for finding a minimum cost flow.
 
 opt2_tsp.h
 2-opt algorithm for symmetric TSP.
 
 pairing_heap.h
 
 path.h
 
 planarity.h
 Planarity checking, embedding, drawing and coloring.
 
 preflow.h
 Implementation of the preflow algorithm.
 
 quad_heap.h
 
 radix_heap.h
 
 radix_sort.h
 Radix sort.
 
 random.cc
 
 random.h
 
 smart_graph.h
 
 soplex.cc
 
 soplex.h
 
 static_graph.h
 
 suurballe.h
 
 time_measure.h
 
 tolerance.h
 
 unionfind.h
 Union-Find data structures.