ordered adjacency lists as a result of planarity testing. More...
#include <GTL/embedding.h>
It is known that if a graph is planar the adjacency list of every node can be
ordered in such a way that it reflects the order the adjacent edges will have
in a planar drawing around the node. Although the tested graph might have been
directed the planar embedding one gets will always correspond to the underlying
undirected graph, i.e. an edge from n1
to n2
will
occurr in both adjacency lists.
[public]
Make this object a copy of em
em | planar embedding |
[public virtual]
Destructor
[public]
Assigns em
to this object. All former information in this
object will be deleted.
em |
[public]
Returns reference to ordered adjacency list of node n
n | node |
[public]
Returns reference to ordered adjacency list of node n
n | node |
[public]
Start iteration through adjacency list of node n
.
n | node. |
[public]
End of iteration through adjacency list of node n
.
n | node. |
[public]
Returns the cyclic successor of edge e
in the adjacency list
of node n
.
e |
edge adjacent to n |
n | node |
e
in adjacency of n
[public]
Returns the cyclic predecessor of edge e
in the adjacency list
of node n
.
e |
edge adjacent to n |
n | node |
e
in adjacency of n
[public]
Writes embedding with st-numbers as given by st
to os
.
st | st-numbers |
os | output stream |
[public]
Returns list of selfloops contained in the graph. These will not occur in the adjacency lists.
[public]
Returns list of selfloops contained in the graph. These will not occur in the adjacency lists.
[public]
Returns list of multiple edges contained in the graph. These are edges for which there is already another edge connecting the same endpoints is contained in the adjacency lists. Please note that the notion "connecting" is meant in an undirected sense. These edges will not occur it the adjacency lists.
[public]
Returns list of multiple edges contained in the graph. These are edges for which there is already another edge connecting the same endpoints is contained in the adjacency lists. Please note that the notion "connecting" is meant in an undirected sense. These edges will not occur it the adjacency lists.
[public]
Used for debugging only. Checks whether this is a correct planar
embedding by checking the faces of the graph, i.e. at any node starting with an
arbitrary adjacent edge and advancing along cyclic_next
the start
node must be met through the edge given by cyclic_prev
of the edge
we started with.
Kdoc |