ListBpGraph is a versatile and fast undirected graph implementation based on linked lists that are stored in std::vector
structures.
This type fully conforms to the BpGraph concept and it also provides several useful additional functionalities. Most of its member functions and nested classes are documented only in the concept class.
This class provides only linear time counting for nodes, edges and arcs.
- See Also
- concepts::BpGraph
-
ListDigraph
#include <lemon/list_graph.h>
Inherits BpGraphExtender< Base >.
|
class | Snapshot |
| Class to make a snapshot of the graph and restore it later. More...
|
|
This function adds a red new node to the graph.
- Returns
- The new node.
This function adds a blue new node to the graph.
- Returns
- The new node.
Edge addEdge |
( |
RedNode |
u, |
|
|
BlueNode |
v |
|
) |
| |
|
inline |
This function adds a new edge to the graph between nodes u
and v
with inherent orientation from node u
to node v
.
- Returns
- The new edge.
This function erases the given node along with its incident arcs from the graph.
- Note
- All iterators referencing the removed node or the incident edges are invalidated, of course.
This function erases the given edge from the graph.
- Note
- All iterators referencing the removed edge are invalidated, of course.
bool valid |
( |
Node |
n | ) |
const |
|
inline |
This function gives back true
if the given node is valid, i.e. it is a real node of the graph.
- Warning
- A removed node could become valid again if new nodes are added to the graph.
bool valid |
( |
Edge |
e | ) |
const |
|
inline |
This function gives back true
if the given edge is valid, i.e. it is a real edge of the graph.
- Warning
- A removed edge could become valid again if new edges are added to the graph.
bool valid |
( |
Arc |
a | ) |
const |
|
inline |
This function gives back true
if the given arc is valid, i.e. it is a real arc of the graph.
- Warning
- A removed arc could become valid again if new edges are added to the graph.
void changeRed |
( |
Edge |
e, |
|
|
RedNode |
n |
|
) |
| |
|
inline |
This function changes the red node of the given edge e
to n
.
- Note
EdgeIt
and ArcIt
iterators referencing the changed edge are invalidated and all other iterators whose base node is the changed node are also invalidated.
- Warning
- This functionality cannot be used together with the Snapshot feature.
void changeBlue |
( |
Edge |
e, |
|
|
BlueNode |
n |
|
) |
| |
|
inline |
This function changes the blue node of the given edge e
to n
.
- Note
EdgeIt
iterators referencing the changed edge remain valid, but ArcIt
iterators referencing the changed edge and all other iterators whose base node is the changed node are also invalidated.
- Warning
- This functionality cannot be used together with the Snapshot feature.
This function erases all nodes and arcs from the graph.
- Note
- All iterators of the graph are invalidated, of course.
void reserveNode |
( |
int |
n | ) |
|
|
inline |
Using this function, it is possible to avoid superfluous memory allocation: if you know that the graph you want to build will be large (e.g. it will contain millions of nodes and/or edges), then it is worth reserving space for this amount before starting to build the graph.
- See Also
- reserveEdge()
void reserveEdge |
( |
int |
m | ) |
|
|
inline |
Using this function, it is possible to avoid superfluous memory allocation: if you know that the graph you want to build will be large (e.g. it will contain millions of nodes and/or edges), then it is worth reserving space for this amount before starting to build the graph.
- See Also
- reserveNode()