#include <lemon/concept/undir_graph.h>
As all concept describing classes it provides only interface without any sensible implementation. So any algorithm for undirected graph should compile with this class, but it will not run properly, of couse.
In LEMON undirected graphs also fulfill the concept of directed graphs (Graph Concept). For explanation of this and more see also the page Undirected graph structures, a tutorial about undirected graphs.
Definition at line 234 of file undir_graph.h.
Public Types | |
typedef GraphNode | Node |
Type describing a node in the graph. | |
typedef GraphItem<'u'> | UndirEdge |
Type describing an undirected edge. | |
typedef UndirGraphEdge | Edge |
Type describing an UndirEdge with direction. | |
typedef GraphIterator | NodeIt |
Iterator type which iterates over all nodes. | |
typedef GraphIterator | UndirEdgeIt |
Iterator type which iterates over all undirected edges. | |
typedef GraphIterator | EdgeIt |
Iterator type which iterates over all directed edges. | |
typedef GraphIncIterator | IncEdgeIt |
Iterator of undirected edges incident to a node. | |
typedef GraphIncIterator | InEdgeIt |
Iterator of edges incoming to a node. | |
typedef GraphIncIterator | OutEdgeIt |
Iterator of edges outgoing from a node. | |
typedef GraphMap | NodeMap<T> |
NodeMap template. | |
typedef GraphMap | UndirEdgeMap<T> |
UndirEdgeMap template. | |
typedef GraphMap | EdgeMap<T> |
EdgeMap template. | |
Public Member Functions | |
bool | forward (Edge) const |
Is the Edge oriented "forward"? | |
Node | oppositeNode (Node, UndirEdge) const |
Opposite node on an edge. | |
Node | source (UndirEdge) const |
First node of the undirected edge. | |
Node | target (UndirEdge) const |
Second node of the undirected edge. | |
Node | source (Edge) const |
Source node of the directed edge. | |
Node | target (Edge) const |
Target node of the directed edge. | |
void | first (Node &) const |
First node of the graph. | |
void | next (Node &) const |
Next node of the graph. | |
void | first (UndirEdge &) const |
First undirected edge of the graph. | |
void | next (UndirEdge &) const |
Next undirected edge of the graph. | |
void | first (Edge &) const |
First directed edge of the graph. | |
void | next (Edge &) const |
Next directed edge of the graph. | |
void | firstOut (Edge &, Node) const |
First outgoing edge from a given node. | |
void | nextOut (Edge &) const |
Next outgoing edge to a node. | |
void | firstIn (Edge &, Node) const |
First incoming edge to a given node. | |
void | nextIn (Edge &) const |
Next incoming edge to a node. | |
Node | baseNode (OutEdgeIt e) const |
Node | runningNode (OutEdgeIt e) const |
Node | baseNode (InEdgeIt e) const |
Node | runningNode (InEdgeIt e) const |
Node | baseNode (IncEdgeIt e) const |
Node | runningNode (IncEdgeIt e) const |
|
Iterator type which iterates over all edges (each undirected edge occurs twice with both directions. Definition at line 271 of file undir_graph.h. |
|
Returns whether the given directed edge is same orientation as the corresponding undirected edge.
Definition at line 344 of file undir_graph.h. |
|
Definition at line 351 of file undir_graph.h. |
|
Definition at line 364 of file undir_graph.h. |
|
Definition at line 380 of file undir_graph.h. |
|
Definition at line 386 of file undir_graph.h. |
|
Definition at line 393 of file undir_graph.h. |
|
Definition at line 399 of file undir_graph.h. |
|
Definition at line 406 of file undir_graph.h. |
|
Definition at line 412 of file undir_graph.h. |
|
Definition at line 419 of file undir_graph.h. |
|
Definition at line 425 of file undir_graph.h. |
|
Definition at line 432 of file undir_graph.h. |
|
Definition at line 438 of file undir_graph.h. |
|
Base node of the iterator Returns the base node (the source in this case) of the iterator Definition at line 444 of file undir_graph.h. |
Here is the call graph for this function:
|
Running node of the iterator Returns the running node (the target in this case) of the iterator Definition at line 451 of file undir_graph.h. |
Here is the call graph for this function:
|
Base node of the iterator Returns the base node (the target in this case) of the iterator Definition at line 458 of file undir_graph.h. |
Here is the call graph for this function:
|
Running node of the iterator Returns the running node (the source in this case) of the iterator Definition at line 465 of file undir_graph.h. |
Here is the call graph for this function:
|
Base node of the iterator Returns the base node of the iterator Definition at line 472 of file undir_graph.h. |
|
Running node of the iterator Returns the running node of the iterator Definition at line 478 of file undir_graph.h. |