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 | BellmanFordDefaultOperationTraits |
| Default OperationTraits for the BellmanFord algorithm class. More... | |
| struct | BellmanFordDefaultTraits |
| Default traits class of BellmanFord class. More... | |
| class | BellmanFord |
| BellmanFord algorithm class. More... | |
| struct | BellmanFordWizardDefaultTraits |
| Default traits class of BellmanFord function. More... | |
| class | BellmanFordWizardBase |
| Default traits used by BellmanFordWizard. More... | |
| class | BellmanFordWizard |
| A class to make the usage of BellmanFord algorithm easier. 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 used by BfsWizard. More... | |
| class | BfsWizard |
| A class to make the usage of Bfs algorithm easier. More... | |
| struct | BfsVisitor |
| Visitor class for bfs. More... | |
| struct | BfsVisitDefaultTraits |
| Default traits class of BfsVisit class. More... | |
| class | BfsVisit |
| BFS Visit algorithm class. More... | |
| class | BinHeap |
| A Binary Heap implementation. More... | |
| class | MaxBipartiteMatching |
| Bipartite Max Cardinality Matching algorithm. More... | |
| struct | MaxWeightedBipartiteMatchingDefaultTraits |
| Default traits class for weighted bipartite matching algoritms. More... | |
| class | MaxWeightedBipartiteMatching |
| Bipartite Max Weighted Matching algorithm. More... | |
| struct | MinCostMaxBipartiteMatchingDefaultTraits |
| Default traits class for minimum cost bipartite matching algoritms. More... | |
| class | MinCostMaxBipartiteMatching |
| Bipartite Min Cost Matching algorithm. More... | |
| class | BpUGraphAdaptorBase |
| Base type for the Bipartite Undirected Graph Adaptors. More... | |
| class | BpUGraphAdaptor |
| Trivial Bipartite Undirected Graph Adaptor. More... | |
| class | SwapBpUGraphAdaptor |
| Bipartite graph adaptor which swaps the two nodeset. More... | |
| class | MatchingBpUGraphAdaptor |
| Bipartite graph adaptor to implement matching algorithms. More... | |
| class | BucketHeap |
| A Bucket Heap implementation. More... | |
| class | SimpleBucketHeap |
| A Simplified Bucket Heap implementation. More... | |
| class | CancelAndTighten |
| Implementation of the Cancel and Tighten algorithm for finding a minimum cost flow. More... | |
| class | CapacityScaling |
| Implementation of the capacity scaling algorithm for finding a minimum cost flow. More... | |
| struct | CirculationDefaultTraits |
| Default traits class of Circulation class. More... | |
| class | Circulation |
| Push-relabel algorithm for the Network Circulation Problem. More... | |
| class | Color |
| class | Palette |
Map ints to different Colors. More... | |
| class | CostScaling |
| Implementation of the cost scaling algorithm for finding a minimum cost flow. More... | |
| class | Counter |
| A counter class. More... | |
| class | NoCounter |
| 'Do nothing' version of Counter More... | |
| class | ConstrainedShortestPath |
| Algorithms for the Resource Constrained Shortest Path Problem. More... | |
| class | CycleCanceling |
| Implementation of a cycle-canceling algorithm for finding a minimum cost flow. More... | |
| struct | DagShortestPathDefaultOperationTraits |
| Default OperationTraits for the DagShortestPath algorithm class. More... | |
| struct | DagShortestPathDefaultTraits |
| Default traits class of DagShortestPath class. More... | |
| struct | DagLongestPathOperationTraits |
| Inverse OperationTraits for the DagShortestPath algorithm class. More... | |
| struct | DagLongestPathTraits |
| Inverse traits class of DagShortestPath class. More... | |
| class | DagShortestPath |
| DagShortestPath algorithm class. More... | |
| struct | DagShortestPathWizardDefaultTraits |
| Default traits class of DagShortestPath function. More... | |
| class | DagShortestPathWizardBase |
| Default traits used by DagShortestPathWizard. More... | |
| class | DagShortestPathWizard |
| A class to make the usage of DagShortestPath algorithm easier. 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 used by DfsWizard. More... | |
| class | DfsWizard |
| A class to make the usage of the Dfs algorithm easier. More... | |
| struct | DfsVisitor |
| Visitor class for dfs. More... | |
| struct | DfsVisitDefaultTraits |
| Default traits class of DfsVisit class. More... | |
| class | DfsVisit |
| DFS Visit algorithm class. More... | |
| struct | DijkstraDefaultOperationTraits |
| Default OperationTraits for the Dijkstra algorithm class. More... | |
| struct | DijkstraWidestPathOperationTraits |
| Widest path OperationTraits 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 used by DijkstraWizard. More... | |
| class | DijkstraWizard |
| A class to make the usage of Dijkstra algorithm easier. More... | |
| struct | DinitzSleatorTarjanDefaultTraits |
| Default traits class of DinitzSleatorTarjan class. More... | |
| class | DinitzSleatorTarjan |
| Dinitz-Sleator-Tarjan algorithms class. More... | |
| class | DistLog |
| Measure a distribution. More... | |
| class | DistLog2 |
| Measure a two dimensional distribution. More... | |
| class | DynamicTree |
| The dynamic tree data structure of Sleator and Tarjan. More... | |
| class | ListEdgeSet |
| Graph using a node set of another graph and an own edge set. More... | |
| class | ListUEdgeSet |
| Graph using a node set of another graph and an own uedge set. More... | |
| class | SmartEdgeSet |
| Graph using a node set of another graph and an own edge set. More... | |
| class | SmartUEdgeSet |
| Graph using a node set of another graph and an own uedge set. More... | |
| struct | EdmondsKarpDefaultTraits |
| Default traits class of EdmondsKarp class. More... | |
| class | EdmondsKarp |
| Edmonds-Karp algorithms class. More... | |
| class | Elevator |
| Class for handling "labels" in push-relabel type algorithms. More... | |
| class | LinkedElevator |
| Class for handling "labels" in push-relabel type algorithms. More... | |
| class | EpsDrawer |
A simple tool to create | |
| class | ExceptionMember |
| Exception safe wrapper class. More... | |
| class | ErrorMessage |
| Exception-safe convenient "error message" class. More... | |
| class | Exception |
| Generic exception class. More... | |
| class | LogicError |
| One of the two main subclasses of Exception. More... | |
| class | UninitializedParameter |
| Exception for uninitialized parameters. More... | |
| class | RuntimeError |
| One of the two main subclasses of Exception. More... | |
| class | RangeError |
| More... | |
| class | IoError |
| More... | |
| class | DataFormatError |
| More... | |
| class | FileOpenError |
| More... | |
| class | AssertionFailedError |
| More... | |
| class | EulerIt |
| Euler iterator for directed graphs. More... | |
| class | UEulerIt |
| Euler iterator for undirected graphs. More... | |
| class | FibHeap |
| Fibonacci Heap. More... | |
| struct | FloydWarshallDefaultOperationTraits |
| Default OperationTraits for the FloydWarshall algorithm class. More... | |
| struct | FloydWarshallDefaultTraits |
| Default traits class of FloydWarshall class. More... | |
| class | FloydWarshall |
| FloydWarshall algorithm class. More... | |
| struct | FredmanTarjanDefaultTraits |
| Default traits class of FredmanTarjan class. More... | |
| class | FredmanTarjan |
| FredmanTarjan algorithm class to find a minimum spanning tree. More... | |
| class | FullGraph |
| A full graph class. More... | |
| class | FullUGraph |
| An undirected full graph class. More... | |
| class | FullBpUGraph |
| An undirected full bipartite graph class. More... | |
| struct | GoldbergTarjanDefaultTraits |
| Default traits class of GoldbergTarjan class. More... | |
| class | GoldbergTarjan |
| Goldberg-Tarjan algorithms class. More... | |
| class | GomoryHuTree |
| Gomory-Hu cut tree algorithm. More... | |
| class | GraphAdaptorBase |
| Base type for the Graph Adaptors. More... | |
| class | GraphAdaptor |
| Trivial Graph Adaptor. More... | |
| class | RevGraphAdaptor |
| A graph adaptor which reverses the orientation of the edges. More... | |
| class | SubGraphAdaptor |
| A graph adaptor for hiding nodes and edges from a graph. More... | |
| class | NodeSubGraphAdaptor |
| An adaptor for hiding nodes from a graph. More... | |
| class | EdgeSubGraphAdaptor |
| An adaptor for hiding edges from a graph. More... | |
| class | UndirGraphAdaptor |
| An undirected graph is made from a directed graph by an adaptor. More... | |
| class | ResGraphAdaptor |
| An adaptor for composing the residual graph for directed flow and circulation problems. More... | |
| class | ErasingFirstGraphAdaptor |
| For blocking flows. More... | |
| class | SplitGraphAdaptorBase |
| Base class for split graph adaptor. More... | |
| class | SplitGraphAdaptor |
| Split graph adaptor class. More... | |
| class | GraphReader |
| The graph reader class. More... | |
| class | UGraphReader |
| The undirected graph reader class. More... | |
| class | BpUGraphReader |
| The bipartite graph reader class. More... | |
| struct | DefaultGraphToEpsTraits |
| Default traits class of GraphToEps. More... | |
| class | GraphToEps |
| Helper class to implement the named parameters of graphToEps(). More... | |
| class | ConEdgeIt |
| Iterator for iterating on edges connected the same nodes. More... | |
| class | ConUEdgeIt |
| Iterator for iterating on uedges connected the same nodes. More... | |
| class | GraphCopy |
| Class to copy a graph. More... | |
| class | UGraphCopy |
| Class to copy an undirected graph. More... | |
| class | BpUGraphCopy |
| Class to copy a bipartite undirected graph. More... | |
| class | IdMap |
| Provides an immutable and unique id for each item in the graph. More... | |
| class | InvertableMap |
| General invertable graph-map type. More... | |
| class | DescriptorMap |
| Provides a mutable, continuous and unique descriptor for each item in the graph. More... | |
| class | SourceMap |
| Returns the source of the given edge. More... | |
| class | TargetMap |
| Returns the target of the given edge. More... | |
| class | ForwardMap |
| Returns the "forward" directed edge view of an undirected edge. More... | |
| class | BackwardMap |
| Returns the "backward" directed edge view of an undirected 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 | DynEdgeLookUp |
| Dynamic edge look up between given endpoints. More... | |
| class | EdgeLookUp |
| Fast edge look up between given endpoints. More... | |
| class | AllEdgeLookUp |
| Fast look up of all edges between given endpoints. More... | |
| class | GraphWriter |
| The graph writer class. More... | |
| class | UGraphWriter |
| The undirected graph writer class. More... | |
| class | BpUGraphWriter |
| The bipartite graph writer class. More... | |
| class | GridUGraph |
| Grid graph class. More... | |
| class | HaoOrlin |
| Hao-Orlin algorithm to find a minimum cut in directed graphs. More... | |
| class | HyperCubeGraph |
| HyperCube graph class. More... | |
| class | IterableBoolMap |
| Dynamic iterable bool map. More... | |
| class | IterableIntMap |
| Dynamic iterable integer map. More... | |
| class | IterableValueMap |
| Dynamic iterable map for comparable values. More... | |
| struct | JohnsonDefaultOperationTraits |
| Default OperationTraits for the Johnson algorithm class. More... | |
| struct | JohnsonDefaultTraits |
| Default traits class of Johnson class. More... | |
| class | Johnson |
| Johnson algorithm class. More... | |
| struct | KruskalDefaultTraits |
| Default traits class of Kruskal class. More... | |
| class | Kruskal |
| Kruskal's algorithm to find a minimum cost tree of a graph. More... | |
| class | LemonReader |
| Lemon Format reader class. More... | |
| class | NodeSetReader |
| SectionReader for reading a graph's nodeset. More... | |
| class | BpNodeSetReader |
| SectionReader for reading a bipartite graph's nodeset. More... | |
| class | EdgeSetReader |
| SectionReader for reading a graph's edgeset. More... | |
| class | UEdgeSetReader |
| SectionReader for reading a undirected graph's edgeset. More... | |
| class | NodeReader |
| SectionReader for reading labeled nodes. More... | |
| class | EdgeReader |
| SectionReader for reading labeled edges. More... | |
| class | UEdgeReader |
| SectionReader for reading labeled undirected edges. More... | |
| class | AttributeReader |
| SectionReader for attributes. More... | |
| class | NodeMapReader |
| SectionReader for reading extra node maps. More... | |
| class | EdgeMapReader |
| SectionReader for reading extra edge maps. More... | |
| class | UEdgeMapReader |
| SectionReader for reading extra undirected edge maps. More... | |
| class | ContentReader |
| SectionReader for retrieve what is in the file. More... | |
| class | LemonWriter |
| Lemon Format writer class. More... | |
| class | NodeSetWriter |
| SectionWriter for writing a graph's nodeset. More... | |
| class | BpNodeSetWriter |
| SectionWriter for writing a bipartite graph's nodeset. More... | |
| class | EdgeSetWriter |
| SectionWriter for writing a graph's edgesets. More... | |
| class | UEdgeSetWriter |
| SectionWriter for writing a undirected edgeset. More... | |
| class | NodeWriter |
| SectionWriter for writing named nodes. More... | |
| class | EdgeWriter |
| SectionWriter for writing named edges. More... | |
| class | UEdgeWriter |
| SectionWriter for writing named undirected edges. More... | |
| class | NodeMapWriter |
| SectionWriter for writing extra node maps. More... | |
| class | EdgeMapWriter |
| SectionWriter for writing extra edge maps. More... | |
| class | UEdgeMapWriter |
| SectionWriter for writing extra undirected edge maps. More... | |
| class | AttributeWriter |
| SectionWriter for attributes. More... | |
| class | ListGraph |
| A list graph class. More... | |
| class | ListUGraph |
| An undirected list graph class. More... | |
| class | ListBpUGraph |
| A smart bipartite undirected graph class. More... | |
| class | LpSolverBase |
| Common base class for LP solvers. More... | |
| class | MipSolverBase |
| Common base class for MIP solvers. More... | |
| class | LpCplex |
| Interface for the CPLEX solver. More... | |
| class | LpGlpk |
| Interface for the GLPK LP solver. More... | |
| class | LpSkeleton |
| A skeleton class to implement LP solver interfaces. More... | |
| class | LpSoplex |
| Interface for the SOPLEX solver. More... | |
| class | LpResultMap |
| class | LpColNameMap |
| class | LpColNameWriteMap |
| class | LpColReader |
| Lp variable item reader for Lemon IO. More... | |
| class | LpColWriter |
| Lp variable item writer for Lemon IO. More... | |
| class | LpReader |
| Lp section reader for lemon IO. More... | |
| class | LpWriter |
| Lp section writer for lemon IO. More... | |
| class | MapIt |
| class | ConstMapIt |
| class | FilterMapIt |
| Iterator for maps which filters items by the values. 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 | StdMap |
Map based on std::map. More... | |
| class | IntegerMap |
Map for storing values for keys from the range [0..size-1]. More... | |
| class | IdentityMap |
| Identity map. More... | |
| class | ConvertMap |
Convert the Value of a map to another type using the default conversion. More... | |
| class | SimpleMap |
| Simple wrapping of a map. More... | |
| class | SimpleWriteMap |
| Simple writable wrapping of a map. More... | |
| class | AddMap |
| Sum of two maps. More... | |
| class | ShiftMap |
| Shift a map with a constant. More... | |
| class | ShiftWriteMap |
| Shift a map with a constant (ReadWrite version). More... | |
| class | SubMap |
| Difference of two maps. More... | |
| class | MulMap |
| Product of two maps. More... | |
| class | ScaleMap |
| Scales a map with a constant. More... | |
| class | ScaleWriteMap |
| Scales a map with a constant (ReadWrite version). More... | |
| class | DivMap |
| Quotient of two maps. More... | |
| class | ComposeMap |
| Composition of two maps. More... | |
| class | CombineMap |
| Combine of two maps using an STL (binary) functor. More... | |
| class | NegMap |
| Negative value of a map. More... | |
| class | NegWriteMap |
| Negative value of a map (ReadWrite version). More... | |
| class | AbsMap |
| Absolute value of a map. More... | |
| class | FunctorMap |
| Converts an STL style functor to a map. More... | |
| class | MapFunctor |
| Converts a map to an STL style (unary) functor. More... | |
| class | ForkMap |
| Just readable version of ForkWriteMap. More... | |
| class | ForkWriteMap |
| Applies all map setting operations to two maps. More... | |
| class | NotMap |
| Logical 'not' of a map. More... | |
| class | NotWriteMap |
| Logical 'not' of a map (ReadWrie version). More... | |
| class | StoreBoolMap |
Writable bool map for logging each true assigned element. More... | |
| class | BackInserterBoolMap |
Writable bool map for logging each true assigned element in a back insertable container. More... | |
| class | FrontInserterBoolMap |
Writable bool map for logging each true assigned element in a front insertable container. More... | |
| class | InserterBoolMap |
Writable bool map for storing each true assigned element in an insertable container. More... | |
| class | FillBoolMap |
Writable bool map for filling each true assigned element with a given value. More... | |
| class | SettingOrderBoolMap |
Writable bool map for storing the sequence number of true assignments. More... | |
| class | MatrixRowMap |
| class | ConstMatrixRowMap |
| class | MatrixColMap |
| class | ConstMatrixColMap |
| class | DynamicMatrixMap |
| Container for store values for each ordered pair of graph items. More... | |
| class | DynamicSymMatrixMap |
| Container for store values for each unordered pair of graph items. More... | |
| class | DynamicAsymMatrixMap |
| Dynamic Asymmetric Matrix Map. More... | |
| class | MaxMatching |
| Edmonds' alternating forest maximum matching algorithm. More... | |
| class | MaxWeightedMatching |
| Weighted matching in general undirected graphs. More... | |
| class | MaxWeightedPerfectMatching |
| Weighted perfect matching in general undirected graphs. More... | |
| struct | MinCostArborescenceDefaultTraits |
| Default traits class of MinCostArborescence class. More... | |
| class | MinCostArborescence |
| MinCostArborescence algorithm class. More... | |
| class | MinCostFlow |
| An efficient algorithm for finding a minimum cost flow. More... | |
| class | MinCostMaxFlow |
| An efficient algorithm for finding a minimum cost maximum flow. More... | |
| class | MinMeanCycle |
| Implementation of Howard's algorithm for finding a minimum mean directed cycle. More... | |
| class | MipCplex |
| Interface for the CPLEX MIP solver. More... | |
| class | MipGlpk |
| Interface for the GLPK MIP solver. More... | |
| struct | MaxCardinalitySearchDefaultTraits |
| Default traits class of MaxCardinalitySearch class. More... | |
| class | MaxCardinalitySearch |
| Maximum Cardinality Search algorithm class. More... | |
| struct | NagamochiIbarakiDefaultTraits |
| Default traits class of NagamochiIbaraki class. More... | |
| class | NagamochiIbaraki |
| Calculates the minimum cut in an undirected graph. More... | |
| class | NetworkSimplex |
| Implementation of the primal network simplex algorithm for finding a minimum cost flow. More... | |
| class | Path |
| A structure for representing directed paths in a graph. More... | |
| class | SimplePath |
| A structure for representing directed paths in a graph. More... | |
| class | ListPath |
| A structure for representing directed paths in a graph. More... | |
| class | StaticPath |
| A structure for representing directed paths in a graph. More... | |
| class | PathNodeIt |
| Class which helps to iterate the nodes of a path. More... | |
| class | PathWriter |
| Item writer for paths. More... | |
| class | PathReader |
| Item reader for paths. More... | |
| class | PlanarityChecking |
| Planarity checking of an undirected simple graph. More... | |
| class | PlanarEmbedding |
| Planar embedding of an undirected simple graph. More... | |
| class | PlanarDrawing |
| Schnyder's planar drawing algorithms. More... | |
| class | PlanarColoring |
| Coloring planar graphs. More... | |
| class | Polynomial |
| Simple polinomial class. More... | |
| class | PrBipartiteMatching |
| Max cardinality matching algorithm based on push-relabel principle. More... | |
| struct | PreflowDefaultTraits |
| Default traits class of Preflow class. More... | |
| class | Preflow |
| Preflow algorithms class. More... | |
| struct | PrimDefaultTraits |
| Default traits class of Prim class. More... | |
| class | Prim |
| Prim algorithm class to find a minimum spanning tree. More... | |
| class | RadixHeap |
| A Radix Heap implementation. More... | |
| class | Random |
| Mersenne Twister random number generator. More... | |
| class | RefPtr |
| Reference counted pointer. More... | |
| class | ControllerBase |
| A base class for controllers. More... | |
| class | EntityBase |
| Skeleton of an entity class. More... | |
| class | SimAnnBase |
| Simulated annealing abstract base class. More... | |
| class | SimAnn |
| Simulated annealing class. More... | |
| class | SimpleController |
| A simple controller for the simulated annealing class. More... | |
| class | AdvancedController |
| A controller with preset running time for the simulated annealing class. More... | |
| class | SmartGraphBase |
| Base of SmartGraph. More... | |
| class | SmartGraph |
| A smart graph class. More... | |
| class | SmartUGraph |
| A smart undirected graph class. More... | |
| class | SmartBpUGraph |
| A smart bipartite undirected graph class. More... | |
| class | SteinerTree |
| Algorithm for the 2-approximation of Steiner Tree problem. More... | |
| class | SubGraphBase |
| class | SubGraph |
| Graph which uses a subset of another graph's nodes and edges. More... | |
| class | EdgeSubGraphBase |
| class | EdgeSubGraph |
| Graph which uses a subset of another graph's edges. More... | |
| class | Suurballe |
| Implementation of an algorithm for finding edge-disjoint paths between two nodes having minimum total length. More... | |
| struct | TabuSearchDefaultTraits |
| Default Traits for TabuSearch class. More... | |
| struct | TabuSearchPolicyConcept |
| Policy hierarchy to controll the search algorithm. More... | |
| struct | PolicyAndCombination |
| Some basic methode, how tow Policies can be combined. More... | |
| struct | CombinePolicies |
| CombinePolicies. More... | |
| struct | IterationPolicy |
| IterationPolicy limits the number of iterations and the number of iterations without improvement. More... | |
| struct | HeightPolicy |
| HeightPolicy stops the search when a given height is reached or exceeds. More... | |
| struct | TimePolicy |
| TimePolicy limits the time for searching. More... | |
| class | TabuSearch |
| TabuSearch main 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 | UGraphAdaptorBase |
| Base type for the Graph Adaptors. More... | |
| class | UGraphAdaptor |
| Trivial undirected graph adaptor. More... | |
| class | SubUGraphAdaptor |
| A graph adaptor for hiding nodes and edges from an undirected graph. More... | |
| class | NodeSubUGraphAdaptor |
| An adaptor for hiding nodes from an undirected graph. More... | |
| class | EdgeSubUGraphAdaptor |
| An adaptor for hiding undirected edges from an undirected graph. More... | |
| class | DirUGraphAdaptorBase |
| Base of direct undirected graph adaptor. More... | |
| class | DirUGraphAdaptor |
| A directed graph is made from an undirected graph by an adaptor. 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... | |
| class | VMapBase |
| Base class of the virtual maps. More... | |
| class | VRefMapBase |
| Base class of the virtual reference maps. More... | |
| class | VReadMap |
| Makes a virtual map from a ReadMap. More... | |
| class | VWriteMap |
| Makes a virtual map from a WriteMap. More... | |
| class | VReadWriteMap |
| Makes a virtual map from a ReadWriteMap. More... | |
| class | AlterationNotifier |
| Notifier class to notify observes about alterations in a container. More... | |
| class | ArrayMap |
| Graph map based on the array storage. More... | |
| class | UndirGraphExtender |
| BaseGraph to BaseUGraph extender. More... | |
| class | DebugMap |
| Graph map based on the std::vector storage. More... | |
| class | DefaultMap |
| More... | |
| class | EdgeSetExtender |
| Extender for the EdgeSets. More... | |
| class | UEdgeSetExtender |
| Extender for the UEdgeSets. More... | |
| class | GraphAdaptorExtender |
| Extender for the GraphAdaptors. More... | |
| class | UGraphAdaptorExtender |
| Extender for the UGraphAdaptors. More... | |
| class | BpUGraphAdaptorExtender |
| Extender for the BpUGraphAdaptors. More... | |
| class | GraphExtender |
| Extender for the Graphs. More... | |
| class | UGraphExtender |
| Extender for the UGraphs. More... | |
| class | BpUGraphExtender |
| Extender for the BpUGraphs. More... | |
| struct | Invalid |
| Dummy type to make it easier to make invalid iterators. More... | |
| class | UnformattedReader |
| Reader class for unformatted strings. More... | |
| class | QuotedStringReader |
| Reader class for quoted strings. More... | |
| class | QuotedCharReader |
| Reader class for quoted strings. More... | |
| class | PushBackReader |
| Reader for standard containers. More... | |
| class | InsertReader |
| Reader for standard containers. More... | |
| class | ParsedStringReader |
| Reader for parsed string. More... | |
| class | LineReader |
| Reader for read the whole line. More... | |
| class | PairReader |
| Reader for std::pair. More... | |
| class | DefaultReader |
| The default item reader template class. More... | |
| class | DefaultSkipper |
| The default item reader for skipping a value in the stream. More... | |
| struct | DefaultReaderTraits |
| Standard ReaderTraits for the GraphReader class. More... | |
| class | UnformattedWriter |
| Writer class for quoted strings. More... | |
| class | QuotedStringWriter |
| Writer class for quoted strings. More... | |
| class | QuotedCharWriter |
| Writer class for quoted chars. More... | |
| class | QuotedCharArrayWriter |
| Writer class for quoted char array. More... | |
| class | IterableWriter |
| Writer for standard containers. More... | |
| class | PairWriter |
| Writer for standard pairs. More... | |
| class | DefaultWriter |
| The default item writer template class. More... | |
| struct | DefaultWriterTraits |
| Standard WriterTraits for the section writers. More... | |
| class | MapExtender |
| Extender for maps. More... | |
| class | SubMapExtender |
| Extender for maps which use a subset of the items. More... | |
| struct | True |
Basic type for defining "tags". A "YES" condition for enable_if. More... | |
| struct | False |
Basic type for defining "tags". A "NO" condition for enable_if. More... | |
| class | BiVariant |
| Simple Variant type for two types. More... | |
| class | Variant |
| Variant type. More... | |
| struct | VariantTypeMap |
| Helper class for Variant. More... | |
| class | VectorMap |
| Graph map based on the std::vector storage. More... | |
| class | TightEdgeFilterMap |
| A map for filtering the edge-set to those edges which are tight w.r.t. a node-potential and edge-distance. More... | |
Typedefs | |
| typedef LpGlpk | Lp |
| The default LP solver. | |
| typedef MipGlpk | Mip |
| The default ILP solver. | |
Functions | |
| template<class _Graph , class _LengthMap > | |
| BellmanFordWizard < BellmanFordWizardBase < _Graph, _LengthMap > > | bellmanFord (const _Graph &graph, const _LengthMap &length, typename _Graph::Node source=INVALID) |
| Function type interface for BellmanFord algorithm. | |
| template<class GR > | |
| BfsWizard< BfsWizardBase< GR > > | bfs (const GR &g, typename GR::Node s=INVALID) |
| Function type interface for Bfs algorithm. | |
| template<typename BpUGraph > | |
| int | maxBipartiteMatching (const BpUGraph &graph) |
| Maximum cardinality bipartite matching. | |
| template<typename BpUGraph , typename MatchingMap > | |
| int | maxBipartiteMatching (const BpUGraph &graph, MatchingMap &matching) |
| Maximum cardinality bipartite matching. | |
| template<typename BpUGraph , typename MatchingMap , typename BarrierMap > | |
| int | maxBipartiteMatching (const BpUGraph &graph, MatchingMap &matching, BarrierMap &barrier) |
| Maximum cardinality bipartite matching. | |
| template<typename BpUGraph , typename WeightMap , typename MatchingMap > | |
| WeightMap::Value | maxWeightedBipartiteMatching (const BpUGraph &graph, const WeightMap &weight, MatchingMap &matching) |
| Maximum weighted bipartite matching. | |
| template<typename BpUGraph , typename WeightMap , typename MatchingMap > | |
| WeightMap::Value | maxWeightedMaxBipartiteMatching (const BpUGraph &graph, const WeightMap &weight, MatchingMap &matching) |
| Maximum weighted maximum cardinality bipartite matching. | |
| template<typename BpUGraph , typename CostMap , typename MatchingMap > | |
| CostMap::Value | minCostMaxBipartiteMatching (const BpUGraph &graph, const CostMap &cost, MatchingMap &matching) |
| Minimum cost maximum cardinality bipartite matching. | |
| Color | distantColor (const Color &c) |
| Returns a visible distinct Color. | |
| Color | distantBW (const Color &c) |
| template<class _Graph , class _LengthMap > | |
| DagShortestPathWizard < DagShortestPathWizardBase < _Graph, _LengthMap > > | dagShortestPath (const _Graph &graph, const _LengthMap &length, typename _Graph::Node source=INVALID) |
| Function type interface for DagShortestPath algorithm. | |
| template<class GR > | |
| DfsWizard< DfsWizardBase< GR > > | dfs (const GR &g, typename GR::Node s=INVALID) |
| Function type interface for Dfs algorithm. | |
| template<class GR , class LM > | |
| DijkstraWizard < DijkstraWizardBase< GR, LM > > | dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID) |
| Function type interface for Dijkstra algorithm. | |
| template<typename Graph , typename LowerMap , typename CapacityMap , typename CostMap , typename SupplyMap > | |
| void | readDimacs (std::istream &is, Graph &g, LowerMap &lower, CapacityMap &capacity, CostMap &cost, SupplyMap &supply) |
| template<typename Graph , typename CapacityMap > | |
| void | readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s, typename Graph::Node &t) |
| template<typename Graph , typename CapacityMap > | |
| void | readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s) |
| template<typename Graph , typename CapacityMap > | |
| void | readDimacs (std::istream &is, Graph &g, CapacityMap &capacity) |
| template<typename Graph > | |
| void | readDimacs (std::istream &is, Graph &g) |
| template<typename Graph > | |
| void | writeDimacs (std::ostream &os, const Graph &g) |
| template<class Graph > | |
| bool | euler (const Graph &g) |
| Checks if the graph is Euler. | |
| template<class Graph , class CostMap , class TreeMap > | |
| void | fredmanTarjan (const Graph &graph, const CostMap &cost, TreeMap &tree) |
| Function type interface for FredmanTarjan algorithm. | |
| template<typename Graph > | |
| GraphAdaptor< const Graph > | graphAdaptor (const Graph &graph) |
| Just gives back a graph adaptor. | |
| template<typename Graph > | |
| RevGraphAdaptor< const Graph > | revGraphAdaptor (const Graph &graph) |
| Just gives back a reverse graph adaptor. | |
| template<typename Graph , typename NodeFilterMap , typename EdgeFilterMap > | |
| SubGraphAdaptor< const Graph, NodeFilterMap, EdgeFilterMap > | subGraphAdaptor (const Graph &graph, NodeFilterMap &nfm, EdgeFilterMap &efm) |
| Just gives back a sub graph adaptor. | |
| template<typename Graph , typename NodeFilterMap > | |
| NodeSubGraphAdaptor< const Graph, NodeFilterMap > | nodeSubGraphAdaptor (const Graph &graph, NodeFilterMap &nfm) |
| Just gives back a node sub graph adaptor. | |
| template<typename Graph , typename EdgeFilterMap > | |
| EdgeSubGraphAdaptor< const Graph, EdgeFilterMap > | edgeSubGraphAdaptor (const Graph &graph, EdgeFilterMap &efm) |
| Just gives back an edge sub graph adaptor. | |
| template<typename Graph > | |
| UndirGraphAdaptor< const Graph > | undirGraphAdaptor (const Graph &graph) |
| Just gives back an undir graph adaptor. | |
| template<typename Graph > | |
| SplitGraphAdaptor< Graph > | splitGraphAdaptor (const Graph &graph) |
| Just gives back a split graph adaptor. | |
| 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<typename Graph , typename Item > | |
| int | countItems (const Graph &g) |
| Function to count the items in the graph. | |
| template<typename Graph > | |
| int | countNodes (const Graph &g) |
| Function to count the nodes in the graph. | |
| template<typename Graph > | |
| int | countANodes (const Graph &g) |
| Function to count the anodes in the graph. | |
| template<typename Graph > | |
| int | countBNodes (const Graph &g) |
| Function to count the bnodes in the graph. | |
| template<typename Graph > | |
| int | countEdges (const Graph &g) |
| Function to count the edges in the graph. | |
| template<typename Graph > | |
| int | countUEdges (const Graph &g) |
| Function to count the undirected edges in the graph. | |
| template<typename Graph > | |
| int | countOutEdges (const Graph &_g, const typename Graph::Node &_n) |
Function to count the number of the out-edges from node n. | |
| template<typename Graph > | |
| int | countInEdges (const Graph &_g, const typename Graph::Node &_n) |
Function to count the number of the in-edges 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 Graph > | |
| Graph::Edge | findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge prev=INVALID) |
| Finds an edge between two nodes of a graph. | |
| template<typename Graph > | |
| Graph::UEdge | findUEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::UEdge p=INVALID) |
| Finds an uedge between two nodes of a graph. | |
| template<typename To , typename From , typename ItemIt , typename Ref > | |
| void | copyMap (To &to, const From &from, ItemIt it, const Ref &ref) |
| Copy a map. | |
| template<typename To , typename From , typename ItemIt > | |
| void | copyMap (To &to, const From &from, ItemIt it) |
| Copy the from map to the to map. | |
| template<typename To , typename From > | |
| GraphCopy< To, From > | copyGraph (To &to, const From &from) |
| Copy a graph to another graph. | |
| template<typename To , typename From > | |
| UGraphCopy< To, From > | copyUGraph (To &to, const From &from) |
| Copy an undirected graph to another graph. | |
| template<typename To , typename From > | |
| BpUGraphCopy< To, From > | copyBpUGraph (To &to, const From &from) |
| Copy a bipartite undirected graph to another graph. | |
| GridUGraph::IndexMap | indexMap (const GridUGraph &graph) |
| Index map of the grid graph. | |
| GridUGraph::RowMap | rowMap (const GridUGraph &graph) |
| Row map of the grid graph. | |
| GridUGraph::ColMap | colMap (const GridUGraph &graph) |
| Column map of the grid graph. | |
| template<class Graph , class In , class Out > | |
| Value | kruskal (GR const &g, const In &in, Out &out) |
| Kruskal's algorithm to find a minimum cost tree of a graph. | |
| template<typename T > | |
| bool | isFinite (T value) |
| Function to decide whether a floating point value is finite or not. | |
| template<typename MatrixMap > | |
| MatrixRowMap< MatrixMap > | matrixRowMap (MatrixMap &matrixMap, typename MatrixMap::FirstKey row) |
| Gives back a row view of the matrix map. | |
| template<typename MatrixMap > | |
| MatrixColMap< MatrixMap > | matrixColMap (MatrixMap &matrixMap, typename MatrixMap::SecondKey col) |
| Gives back a column view of the matrix map. | |
| template<typename Graph , typename CostMap , typename ArborescenceMap > | |
| CostMap::Value | minCostArborescence (const Graph &graph, const CostMap &cost, typename Graph::Node source, ArborescenceMap &arborescence) |
| Function type interface for MinCostArborescence algorithm. | |
| template<typename UGraph > | |
| std::istream & | readNauty (std::istream &is, UGraph &ugraph) |
| Nauty file reader. | |
| template<typename Target , typename Source > | |
| void | copyPath (Target &target, const Source &source) |
| template<typename Graph , typename Path > | |
| bool | checkPath (const Graph &graph, const Path &path) |
| Checks the path's consistency. | |
| template<typename Graph , typename Path > | |
| Graph::Node | pathSource (const Graph &graph, const Path &path) |
| template<typename Graph , typename Path > | |
| Graph::Node | pathTarget (const Graph &graph, const Path &path) |
| template<class Graph > | |
| int | prBipartiteMatching (const Graph &g) |
| Maximum cardinality of the matchings in a bipartite graph. | |
| template<class Graph , class MT > | |
| int | prBipartiteMatching (const Graph &g, MT &matching) |
| Maximum cardinality matching in a bipartite graph. | |
| template<class Graph , class MT , class GT > | |
| int | prBipartiteMatching (const Graph &g, MT &matching, GT &barrier) |
| Maximum cardinality matching in a bipartite graph. | |
| template<class Graph > | |
| bool | prPerfectBipartiteMatching (const Graph &g) |
| Perfect matching in a bipartite graph. | |
| template<class Graph , class MT > | |
| bool | prPerfectBipartiteMatching (const Graph &g, MT &matching) |
| Perfect matching in a bipartite graph. | |
| template<class Graph , class MT , class GT > | |
| bool | prPerfectBipartiteMatching (const Graph &g, MT &matching, GT &barrier) |
| Perfect matching in a bipartite graph. | |
| template<class Graph , class CostMap , class TreeMap > | |
| CostMap::Value | prim (const Graph &graph, const CostMap &cost, TreeMap &tree) |
| Function type interface for Prim algorithm. | |
| template<class Graph , class CostMap , class TreeMap > | |
| CostMap::Value | prim (const Graph &graph, const CostMap &cost) |
| Function type interface for Prim algorithm. | |
| template<typename Iterator , typename Functor > | |
| void | radixSort (Iterator first, Iterator last, Functor functor) |
| Sorts the stl compatible range into ascending order. | |
| template<typename Iterator , typename Functor > | |
| void | counterSort (Iterator first, Iterator last, Functor functor) |
| Sorts stable the stl compatible range into ascending order. | |
| 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. | |
| template<typename UGraph > | |
| bool | connected (const UGraph &graph) |
| Check that the given undirected graph is connected. | |
| template<typename UGraph > | |
| int | countConnectedComponents (const UGraph &graph) |
| Count the number of connected components of an undirected graph. | |
| template<class UGraph , class NodeMap > | |
| int | connectedComponents (const UGraph &graph, NodeMap &compMap) |
| Find the connected components of an undirected graph. | |
| template<typename Graph > | |
| bool | stronglyConnected (const Graph &graph) |
| Check that the given directed graph is strongly connected. | |
| template<typename Graph > | |
| int | countStronglyConnectedComponents (const Graph &graph) |
| Count the strongly connected components of a directed graph. | |
| template<typename Graph , typename NodeMap > | |
| int | stronglyConnectedComponents (const Graph &graph, NodeMap &compMap) |
| Find the strongly connected components of a directed graph. | |
| template<typename Graph , typename EdgeMap > | |
| int | stronglyConnectedCutEdges (const Graph &graph, EdgeMap &cutMap) |
| Find the cut edges of the strongly connected components. | |
| template<typename UGraph > | |
| int | countBiNodeConnectedComponents (const UGraph &graph) |
| Count the biconnected components. | |
| template<typename UGraph > | |
| bool | biNodeConnected (const UGraph &graph) |
| Checks the graph is bi-node-connected. | |
| template<typename UGraph , typename UEdgeMap > | |
| int | biNodeConnectedComponents (const UGraph &graph, UEdgeMap &compMap) |
| Find the bi-node-connected components. | |
| template<typename UGraph , typename NodeMap > | |
| int | biNodeConnectedCutNodes (const UGraph &graph, NodeMap &cutMap) |
| Find the bi-node-connected cut nodes. | |
| template<typename UGraph > | |
| int | countBiEdgeConnectedComponents (const UGraph &graph) |
| Count the bi-edge-connected components. | |
| template<typename UGraph > | |
| bool | biEdgeConnected (const UGraph &graph) |
| Checks that the graph is bi-edge-connected. | |
| template<typename UGraph , typename NodeMap > | |
| int | biEdgeConnectedComponents (const UGraph &graph, NodeMap &compMap) |
| Find the bi-edge-connected components. | |
| template<typename UGraph , typename UEdgeMap > | |
| int | biEdgeConnectedCutEdges (const UGraph &graph, UEdgeMap &cutMap) |
| Find the bi-edge-connected cut edges. | |
| template<typename Graph , typename NodeMap > | |
| void | topologicalSort (const Graph &graph, NodeMap &order) |
| Sort the nodes of a DAG into topolgical order. | |
| template<typename Graph , typename NodeMap > | |
| bool | checkedTopologicalSort (const Graph &graph, NodeMap &order) |
| Sort the nodes of a DAG into topolgical order. | |
| template<typename Graph > | |
| bool | dag (const Graph &graph) |
| Check that the given directed graph is a DAG. | |
| template<typename UGraph > | |
| bool | acyclic (const UGraph &graph) |
| Check that the given undirected graph is acyclic. | |
| template<typename UGraph > | |
| bool | tree (const UGraph &graph) |
| Check that the given undirected graph is tree. | |
| template<typename UGraph > | |
| bool | bipartite (const UGraph &graph) |
| Check if the given undirected graph is bipartite or not. | |
| template<typename UGraph , typename NodeMap > | |
| bool | bipartitePartitions (const UGraph &graph, NodeMap &partMap) |
| Check if the given undirected graph is bipartite or not. | |
| template<typename Graph > | |
| bool | loopFree (const Graph &graph) |
| template<typename Graph > | |
| bool | parallelFree (const Graph &graph) |
| template<typename Graph > | |
| bool | simpleGraph (const Graph &graph) |
| template<typename UGraph , typename DirectionMap > | |
| DirUGraphAdaptor< const UGraph, DirectionMap > | dirUGraphAdaptor (const UGraph &graph, DirectionMap &dm) |
| Just gives back a DirUGraphAdaptor. | |
| template<class M , class K = typename M::Key, class V = typename M::Value> | |
| vReadMap (const M &m) | |
| Function interface for VReadMap. | |
| template<class M , class K = typename M::Key, class V = typename M::Value> | |
| vWriteMap (const M &m) | |
| Function interface for VWriteMap. | |
| template<class M , class K = typename M::Key, class V = typename M::Value> | |
| vReadWriteMap (const M &m) | |
| Function interface for VReadWriteMap. | |
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 char | default_solver_name [] = "SOLVER" |
| The default LP solver identifier string. | |
| 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. | |
| DagShortestPathWizard<DagShortestPathWizardBase<_Graph,_LengthMap> > lemon::dagShortestPath | ( | const _Graph & | graph, | |
| const _LengthMap & | length, | |||
| typename _Graph::Node | source = INVALID | |||
| ) | [inline] |
Function type interface for DagShortestPath algorithm.
This function also has several named parameters, they are declared as the members of class DagShortestPathWizard. The following example shows how to use these parameters.
dagShortestPath(g,length,source).predMap(preds).run();
| GraphAdaptor<const Graph> lemon::graphAdaptor | ( | const Graph & | graph | ) | [inline] |
Just gives back a graph adaptor which should be provide original graph
| RevGraphAdaptor<const Graph> lemon::revGraphAdaptor | ( | const Graph & | graph | ) | [inline] |
Just gives back a reverse graph adaptor
| SubGraphAdaptor< const Graph, const NodeFilterMap, const EdgeFilterMap > subGraphAdaptor | ( | const Graph & | graph, | |
| NodeFilterMap & | nfm, | |||
| EdgeFilterMap & | efm | |||
| ) | [inline] |
Just gives back a sub graph adaptor
| NodeSubGraphAdaptor<const Graph, NodeFilterMap> lemon::nodeSubGraphAdaptor | ( | const Graph & | graph, | |
| NodeFilterMap & | nfm | |||
| ) | [inline] |
Just gives back a node sub graph adaptor
| EdgeSubGraphAdaptor<const Graph, EdgeFilterMap> lemon::edgeSubGraphAdaptor | ( | const Graph & | graph, | |
| EdgeFilterMap & | efm | |||
| ) | [inline] |
Just gives back an edge sub graph adaptor
| UndirGraphAdaptor<const Graph> lemon::undirGraphAdaptor | ( | const Graph & | graph | ) | [inline] |
Just gives back an undir graph adaptor
| SplitGraphAdaptor<Graph> lemon::splitGraphAdaptor | ( | const Graph & | graph | ) | [inline] |
Just gives back a split graph adaptor
| GridUGraph::IndexMap lemon::indexMap | ( | const GridUGraph & | graph | ) | [inline] |
Just returns an IndexMap for the grid graph.
| GridUGraph::RowMap lemon::rowMap | ( | const GridUGraph & | graph | ) | [inline] |
Just returns a RowMap for the grid graph.
| GridUGraph::ColMap lemon::colMap | ( | const GridUGraph & | graph | ) | [inline] |
Just returns a ColMap for the grid graph.
| bool lemon::isFinite | ( | T | value | ) | [inline] |
Retruns true if the argument is not infinity, minus infinity or NaN. It does the same as the isfinite() function defined by C99.
| void lemon::copyPath | ( | Target & | target, | |
| const Source & | source | |||
| ) | [inline] |
Make of copy of a path.
| bool lemon::checkPath | ( | const Graph & | graph, | |
| const Path & | path | |||
| ) | [inline] |
Checks that each edge's target is the next's source.
| Graph::Node lemon::pathSource | ( | const Graph & | graph, | |
| const Path & | path | |||
| ) | [inline] |
Gives back the source of the path.
| Graph::Node lemon::pathTarget | ( | const Graph & | graph, | |
| const Path & | path | |||
| ) | [inline] |
Gives back the target of the path.
| bool lemon::loopFree | ( | const Graph & | graph | ) | [inline] |
Returns true when there is not loop edge in the graph.
| bool lemon::parallelFree | ( | const Graph & | graph | ) | [inline] |
Returns true when there is not parallel edges in the graph.
| bool lemon::simpleGraph | ( | const Graph & | graph | ) | [inline] |
Returns true when there is not loop edge and parallel edges in the graph.
| DirUGraphAdaptor<const UGraph, DirectionMap> lemon::dirUGraphAdaptor | ( | const UGraph & | graph, | |
| DirectionMap & | dm | |||
| ) | [inline] |
Just gives back a DirUGraphAdaptor
Invalid is a global type that converts to each iterator in such a way that the value of the target iterator will be invalid.
1.5.9