#include <iterator>
#include <vector>
#include <map>
#include <lemon/invalid.h>
#include <lemon/utility.h>
#include <lemon/maps.h>
#include <lemon/bits/alteration_notifier.h>
Go to the source code of this file.
Namespaces | |
namespace | lemon |
Classes | |
class | ConEdgeIt |
Iterator for iterating on edges connected the same nodes. More... | |
class | GraphCopy |
Class to copy a graph. More... | |
class | IdMap |
Provides an immutable and unique id for each item in the graph. More... | |
class | IdMap::InverseMap |
The class represents the inverse of its owner (IdMap). More... | |
class | InvertableMap |
General invertable graph-map type. More... | |
class | InvertableMap::InverseMap |
The inverse map type. More... | |
class | DescriptorMap |
Provides a mutable, continuous and unique descriptor for each item in the graph. More... | |
class | DescriptorMap::InverseMap |
The inverse map type of DescriptorMap. 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 | InDegMap |
Map of the node in-degrees. More... | |
class | OutDegMap |
Map of the node out-degrees. More... | |
Functions | |
template<typename Graph, typename ItemIt> | |
int | lemon::countItems (const Graph &g) |
Function to count the items in the graph. | |
template<typename Graph> | |
int | lemon::countNodes (const Graph &g) |
Function to count the nodes in the graph. | |
template<typename Graph> | |
int | lemon::countEdges (const Graph &g) |
Function to count the edges in the graph. | |
template<typename Graph> | |
int | lemon::countUndirEdges (const Graph &g) |
Function to count the undirected edges in the graph. | |
template<typename Graph> | |
int | lemon::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 | lemon::countInEdges (const Graph &_g, const typename Graph::Node &_n) |
Function to count the number of the in-edges to node n . | |
template<typename Graph> | |
Graph::Edge | lemon::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 Target, typename Source, typename ItemIt, typename Ref> | |
void | lemon::copyMap (Target &target, const Source &source, ItemIt it, const Ref &ref) |
Copy a map. | |
template<typename Target, typename Source, typename ItemIt> | |
void | lemon::copyMap (Target &target, const Source &source, ItemIt it) |
Copy the source map to the target map. | |
template<typename Target, typename Source> | |
GraphCopy< Target, Source > | lemon::copyGraph (Target &target, const Source &source) |
Copy a graph to an other graph. |