Namespaces | |
namespace | concepts |
The namespace of LEMON concepts and concept checking classes. | |
namespace | dim2 |
Tools for handling two dimensional coordinates. | |
Classes | |
class | ArgParser |
Command line arguments parser. More... | |
struct | BfsDefaultTraits |
Default traits class of Bfs class. More... | |
class | Bfs |
BFS algorithm class. More... | |
struct | BfsWizardDefaultTraits |
Default traits class of bfs() function. More... | |
class | BfsWizardBase |
Default traits class used by BfsWizard. More... | |
class | BfsWizard |
Auxiliary class for the function-type interface of BFS algorithm. More... | |
struct | BfsVisitor |
Visitor class for BFS. More... | |
struct | BfsVisitDefaultTraits |
Default traits class of BfsVisit class. More... | |
class | BfsVisit |
BFS algorithm class with visitor interface. More... | |
class | BinHeap |
A Binary Heap implementation. More... | |
class | Color |
Data structure representing RGB colors. More... | |
class | Palette |
Map int s to different Color s. More... | |
struct | Invalid |
Dummy type to make it easier to create invalid iterators. More... | |
class | DigraphCopy |
Class to copy a digraph. More... | |
class | GraphCopy |
Class to copy a graph. More... | |
class | ConArcIt |
Iterator for iterating on parallel arcs connecting the same nodes. More... | |
class | ConEdgeIt |
Iterator for iterating on parallel edges connecting the same nodes. More... | |
class | DynArcLookUp |
Dynamic arc look-up between given endpoints. More... | |
class | ArcLookUp |
Fast arc look-up between given endpoints. More... | |
class | AllArcLookUp |
Fast look-up of all arcs between given endpoints. More... | |
class | Counter |
A counter class. More... | |
class | NoCounter |
'Do nothing' version of Counter. More... | |
struct | DfsDefaultTraits |
Default traits class of Dfs class. More... | |
class | Dfs |
DFS algorithm class. More... | |
struct | DfsWizardDefaultTraits |
Default traits class of dfs() function. More... | |
class | DfsWizardBase |
Default traits class used by DfsWizard. More... | |
class | DfsWizard |
Auxiliary class for the function-type interface of DFS algorithm. More... | |
struct | DfsVisitor |
Visitor class for DFS. More... | |
struct | DfsVisitDefaultTraits |
Default traits class of DfsVisit class. More... | |
class | DfsVisit |
DFS algorithm class with visitor interface. More... | |
struct | DijkstraDefaultOperationTraits |
Default operation traits for the Dijkstra algorithm class. More... | |
struct | DijkstraWidestPathOperationTraits |
Widest path operation traits for the Dijkstra algorithm class. More... | |
struct | DijkstraDefaultTraits |
Default traits class of Dijkstra class. More... | |
class | Dijkstra |
Dijkstra algorithm class. More... | |
struct | DijkstraWizardDefaultTraits |
Default traits class of dijkstra() function. More... | |
class | DijkstraWizardBase |
Default traits class used by DijkstraWizard. More... | |
class | DijkstraWizard |
Auxiliary class for the function-type interface of Dijkstra algorithm. More... | |
class | Exception |
Generic exception class. More... | |
class | IoError |
Input-Output error. More... | |
class | FormatError |
Format error. More... | |
struct | DefaultGraphToEpsTraits |
Default traits class of GraphToEps. More... | |
class | GraphToEps |
Auxiliary class to implement the named parameters of graphToEps(). More... | |
class | DigraphReader |
LGF reader for directed graphs More... | |
class | GraphReader |
LGF reader for undirected graphs More... | |
class | SectionReader |
Section reader class. More... | |
class | LgfContents |
Reader for the contents of the LGF file. More... | |
class | DigraphWriter |
LGF writer for directed graphs More... | |
class | GraphWriter |
LGF writer for directed graphs More... | |
class | SectionWriter |
Section writer class. More... | |
class | ListDigraph |
A general directed graph structure. More... | |
class | ListGraph |
A general undirected graph structure. More... | |
class | MapBase |
Base class of maps. More... | |
class | NullMap |
Null map. (a.k.a. DoNothingMap). More... | |
class | ConstMap |
Constant map. More... | |
class | ConstMap< K, Const< V, v > > |
Constant map with inlined constant value. More... | |
class | IdentityMap |
Identity map. More... | |
class | RangeMap |
Map for storing values for integer keys from the range [0..size-1] . More... | |
class | SparseMap |
Map type based on std::map . More... | |
class | ComposeMap |
Composition of two maps. More... | |
class | CombineMap |
Combination of two maps using an STL (binary) functor. More... | |
class | FunctorToMap |
Converts an STL style (unary) functor to a map. More... | |
class | MapToFunctor |
Converts a map to an STL style (unary) functor. More... | |
class | ConvertMap |
Map adaptor to convert the Value type of a map to another type using the default conversion. More... | |
class | ForkMap |
Applies all map setting operations to two maps. More... | |
class | AddMap |
Sum of two maps. More... | |
class | SubMap |
Difference of two maps. More... | |
class | MulMap |
Product of two maps. More... | |
class | DivMap |
Quotient of two maps. More... | |
class | ShiftMap |
Shifts a map with a constant. More... | |
class | ShiftWriteMap |
Shifts a map with a constant (read-write version). More... | |
class | ScaleMap |
Scales a map with a constant. More... | |
class | ScaleWriteMap |
Scales a map with a constant (read-write version). More... | |
class | NegMap |
Negative of a map. More... | |
class | NegWriteMap |
Negative of a map (read-write version). More... | |
class | AbsMap |
Absolute value of a map. More... | |
class | TrueMap |
Constant true map. More... | |
class | FalseMap |
Constant false map. More... | |
class | AndMap |
Logical 'and' of two maps. More... | |
class | OrMap |
Logical 'or' of two maps. More... | |
class | NotMap |
Logical 'not' of a map. More... | |
class | NotWriteMap |
Logical 'not' of a map (read-write version). More... | |
class | EqualMap |
Combination of two maps using the == operator. More... | |
class | LessMap |
Combination of two maps using the < operator. More... | |
class | LoggerBoolMap |
Writable bool map for logging each true assigned element. More... | |
class | IdMap |
Provides an immutable and unique id for each item in the graph. More... | |
class | SourceMap |
Returns the source of the given arc. More... | |
class | TargetMap |
Returns the target of the given arc. More... | |
class | ForwardMap |
Returns the "forward" directed arc view of an edge. More... | |
class | BackwardMap |
Returns the "backward" directed arc view of an edge. More... | |
class | PotentialDifferenceMap |
Potential difference map. More... | |
class | InDegMap |
Map of the node in-degrees. More... | |
class | OutDegMap |
Map of the node out-degrees. More... | |
class | Path |
A structure for representing directed paths in a digraph. More... | |
class | SimplePath |
A structure for representing directed paths in a digraph. More... | |
class | ListPath |
A structure for representing directed paths in a digraph. More... | |
class | StaticPath |
A structure for representing directed paths in a digraph. More... | |
class | PathNodeIt |
Class which helps to iterate through the nodes of a path. More... | |
class | Random |
Mersenne Twister random number generator. More... | |
class | SmartDigraphBase |
Base of SmartDigraph. More... | |
class | SmartDigraph |
A smart directed graph class. More... | |
class | SmartGraph |
A smart undirected graph class. More... | |
class | TimeStamp |
A class to store (cpu)time instances. More... | |
class | Timer |
Class for measuring the cpu time and real time usage of the process. More... | |
class | TimeReport |
Same as Timer but prints a report on destruction. More... | |
class | NoTimeReport |
'Do nothing' version of TimeReport More... | |
class | Tolerance |
A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation. More... | |
class | Tolerance< float > |
Float specialization of Tolerance. More... | |
class | Tolerance< double > |
Double specialization of Tolerance. More... | |
class | Tolerance< long double > |
Long double specialization of Tolerance. More... | |
class | Tolerance< int > |
Integer specialization of Tolerance. More... | |
class | Tolerance< unsigned int > |
Unsigned integer specialization of Tolerance. More... | |
class | Tolerance< long int > |
Long integer specialization of Tolerance. More... | |
class | Tolerance< unsigned long int > |
Unsigned long integer specialization of Tolerance. More... | |
class | UnionFind |
A Union-Find data structure implementation. More... | |
class | UnionFindEnum |
A Union-Find data structure implementation which is able to enumerate the components. More... | |
class | ExtendFindEnum |
A Extend-Find data structure implementation which is able to enumerate the components. More... | |
class | HeapUnionFind |
A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. More... | |
Functions | |
template<class GR > | |
BfsWizard< BfsWizardBase< GR > > | bfs (const GR &digraph) |
Function-type interface for BFS algorithm. | |
Color | distantColor (const Color &c) |
Returns a visibly distinct Color. | |
Color | distantBW (const Color &c) |
Returns black for light colors and white for the dark ones. | |
template<class Concept > | |
void | function_requires () |
| |
template<typename Concept , typename Type > | |
void | checkConcept () |
| |
template<typename Graph , typename Item > | |
int | countItems (const Graph &g) |
Function to count the items in a graph. | |
template<typename Graph > | |
int | countNodes (const Graph &g) |
Function to count the nodes in the graph. | |
template<typename Graph > | |
int | countArcs (const Graph &g) |
Function to count the arcs in the graph. | |
template<typename Graph > | |
int | countEdges (const Graph &g) |
Function to count the edges in the graph. | |
template<typename Graph > | |
int | countOutArcs (const Graph &g, const typename Graph::Node &n) |
Function to count the number of the out-arcs from node n . | |
template<typename Graph > | |
int | countInArcs (const Graph &g, const typename Graph::Node &n) |
Function to count the number of the in-arcs to node n . | |
template<typename Graph > | |
int | countIncEdges (const Graph &g, const typename Graph::Node &n) |
Function to count the number of the inc-edges to node n . | |
template<typename From , typename To > | |
DigraphCopy< From, To > | digraphCopy (const From &from, To &to) |
Copy a digraph to another digraph. | |
template<typename From , typename To > | |
GraphCopy< From, To > | graphCopy (const From &from, To &to) |
Copy a graph to another graph. | |
template<typename Graph > | |
Graph::Arc | findArc (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Arc prev=INVALID) |
Find an arc between two nodes of a digraph. | |
template<typename Graph > | |
Graph::Edge | findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge p=INVALID) |
Find an edge between two nodes of a graph. | |
template<class GR > | |
DfsWizard< DfsWizardBase< GR > > | dfs (const GR &digraph) |
Function-type interface for DFS algorithm. | |
template<class GR , class LM > | |
DijkstraWizard < DijkstraWizardBase< GR, LM > > | dijkstra (const GR &digraph, const LM &length) |
Function-type interface for Dijkstra algorithm. | |
template<class G > | |
GraphToEps < DefaultGraphToEpsTraits< G > > | graphToEps (G &g, std::ostream &os=std::cout) |
Generates an EPS file from a graph. | |
template<class G > | |
GraphToEps < DefaultGraphToEpsTraits< G > > | graphToEps (G &g, const char *file_name) |
Generates an EPS file from a graph. | |
template<class G > | |
GraphToEps < DefaultGraphToEpsTraits< G > > | graphToEps (G &g, const std::string &file_name) |
Generates an EPS file from a graph. | |
template<class Graph , class In , class Out > | |
Value | kruskal (GR const &g, const In &in, Out &out) |
Kruskal algorithm to find a minimum cost spanning tree of a graph. | |
template<typename Target , typename Source > | |
void | copyPath (Target &target, const Source &source) |
Make a copy of a path. | |
template<typename Digraph , typename Path > | |
bool | checkPath (const Digraph &digraph, const Path &path) |
Check the consistency of a path. | |
template<typename Digraph , typename Path > | |
Digraph::Node | pathSource (const Digraph &digraph, const Path &path) |
The source of a path. | |
template<typename Digraph , typename Path > | |
Digraph::Node | pathTarget (const Digraph &digraph, const Path &path) |
The target of a path. | |
template<class F > | |
TimeStamp | runningTimeTest (F f, double min_time=10, unsigned int *num=NULL, TimeStamp *full_time=NULL) |
Tool to measure the running time more exactly. | |
Variables | |
const Invalid | INVALID = Invalid() |
Invalid iterators. | |
const Color | WHITE (1, 1, 1) |
White color constant. | |
const Color | BLACK (0, 0, 0) |
Black color constant. | |
const Color | RED (1, 0, 0) |
Red color constant. | |
const Color | GREEN (0, 1, 0) |
Green color constant. | |
const Color | BLUE (0, 0, 1) |
Blue color constant. | |
const Color | YELLOW (1, 1, 0) |
Yellow color constant. | |
const Color | MAGENTA (1, 0, 1) |
Magenta color constant. | |
const Color | CYAN (0, 1, 1) |
Cyan color constant. | |
const Color | GREY (0, 0, 0) |
Grey color constant. | |
const Color | DARK_RED (.5, 0, 0) |
Dark red color constant. | |
const Color | DARK_GREEN (0,.5, 0) |
Dark green color constant. | |
const Color | DARK_BLUE (0, 0,.5) |
Drak blue color constant. | |
const Color | DARK_YELLOW (.5,.5, 0) |
Dark yellow color constant. | |
const Color | DARK_MAGENTA (.5, 0,.5) |
Dark magenta color constant. | |
const Color | DARK_CYAN (0,.5,.5) |
Dark cyan color constant. | |
const long double | E = 2.7182818284590452353602874713526625L |
The Euler constant. | |
const long double | LOG2E = 1.4426950408889634073599246810018921L |
log_2(e) | |
const long double | LOG10E = 0.4342944819032518276511289189166051L |
log_10(e) | |
const long double | LN2 = 0.6931471805599453094172321214581766L |
ln(2) | |
const long double | LN10 = 2.3025850929940456840179914546843642L |
ln(10) | |
const long double | PI = 3.1415926535897932384626433832795029L |
pi | |
const long double | PI_2 = 1.5707963267948966192313216916397514L |
pi/2 | |
const long double | PI_4 = 0.7853981633974483096156608458198757L |
pi/4 | |
const long double | SQRT2 = 1.4142135623730950488016887242096981L |
sqrt(2) | |
const long double | SQRT1_2 = 0.7071067811865475244008443621048490L |
1/sqrt(2) | |
Random | rnd |
Global random number generator instance. |
Invalid is a global type that converts to each iterator in such a way that the value of the target iterator will be invalid.