FullDigraph
Declared in lemon/full_graph.h, in the group Graph Structures; the same class on the Doxygen site.
-
class FullDigraph : public DigraphExtender< FullDigraphBase >
A directed full graph class.
FullDigraph is a simple and fast implmenetation of directed full (complete) graphs. It contains an arc from each node to each node (including a loop for each node), therefore the number of arcs is the square of the number of nodes. This class is completely static and it needs constant memory space. Thus you can neither add nor delete nodes or arcs, however the structure can be resized using resize().
This type fully conforms to the Digraph concept. Most of its member functions and nested classes are documented only in the concept class.
This class provides constant time counting for nodes and arcs.
See also
Note
FullDigraph and FullGraph classes are very similar, but there are two differences. While this class conforms only to the Digraph concept, FullGraph conforms to the Graph concept, moreover FullGraph does not contain a loop for each node as this class does.
Public Functions
-
inline FullDigraph()
Default constructor. The number of nodes and arcs will be zero.
-
inline FullDigraph( int n )
Constructor.
- Parameters:
n – The number of the nodes.
-
inline void resize( int n )
Resizes the digraph.
This function resizes the digraph. It fully destroys and rebuilds the structure, therefore the maps of the digraph will be reallocated automatically and the previous values will be lost.
-
inline Node operator()( int ix ) const
Returns the node with the given index. Since this structure is completely static, the nodes can be indexed with integers from the range
[0..nodeNum()-1]. The index of a node is the same as its ID.See also
-
inline Arc arc( Node u , Node v ) const
Returns the arc connecting the given nodes.
-
inline int nodeNum() const
Number of nodes.
-
inline int arcNum() const
Number of arcs.
-
inline FullDigraph()