FullGraph

Declared in lemon/full_graph.h, in the group Graph Structures; the same class on the Doxygen site.

class FullGraph : public GraphExtender< FullGraphBase >

An undirected full graph class.

FullGraph is a simple and fast implmenetation of undirected full (complete) graphs. It contains an edge between every distinct pair of nodes, therefore the number of edges is n(n-1)/2. This class is completely static and it needs constant memory space. Thus you can neither add nor delete nodes or edges, however the structure can be resized using resize().

This type fully conforms to the Graph concept. Most of its member functions and nested classes are documented only in the concept class.

This class provides constant time counting for nodes, edges and arcs.

See also

FullDigraph

Note

FullDigraph and FullGraph classes are very similar, but there are two differences. While FullDigraph conforms only to the Digraph concept, this class conforms to the Graph concept, moreover this class does not contain a loop for each node as FullDigraph does.

Public Functions

inline FullGraph()

Default constructor. The number of nodes and edges will be zero.

inline FullGraph( int n )

Constructor.

Parameters:

n – The number of the nodes.

inline void resize( int n )

Resizes the graph.

This function resizes the graph. It fully destroys and rebuilds the structure, therefore the maps of the graph 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

index()

inline Arc arc( Node s , Node t ) const

Returns the arc connecting the given nodes.

inline Edge edge( Node u , Node v ) const

Returns the edge connecting the given nodes.

inline int nodeNum() const

Number of nodes.

inline int arcNum() const

Number of arcs.

inline int edgeNum() const

Number of edges.

Public Static Functions

static inline int index( const Node & node )

Returns the index of the given node. 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

operator()()