#include <ogdf/basic/AdjEntryArray.h>
Go to the source code of this file.
Namespaces | |
| namespace | ogdf |
Classes | |
| class | ogdf::FaceElement |
| Faces in a combinatorial embedding. More... | |
| class | ogdf::ConstCombinatorialEmbedding |
| Combinatorial embeddings of planar graphs. More... | |
| class | ogdf::CombinatorialEmbedding |
| Combinatorial embeddings of planar graphs with modification functionality. More... | |
Defines | |
| #define | forall_faces(f, E) for((f)=(E).firstFace(); (f); (f)=(f)->succ()) |
| Iteration over all faces f of the combinatorial embedding E. | |
| #define | forall_rev_faces(f, E) for((f)=(E).lastFace(); (f); (f)=(f)->pred()) |
| Iteration over all faces f of the combinatorial embedding E (in reverse order). | |
| #define | forall_face_adj(adj, f) for((adj)=(f)->firstAdj(); (adj); (adj)=(f)->nextFaceEdge(adj)) |
| Iteration over all adjacency entries adj of the face f. | |
Typedefs | |
| typedef FaceElement * | ogdf::face |
Enriches graph by the notion of faces
Definition in file CombinatorialEmbedding.h.
| #define forall_face_adj | ( | adj, | |||
| f | ) | for((adj)=(f)->firstAdj(); (adj); (adj)=(f)->nextFaceEdge(adj)) |
Iteration over all adjacency entries adj of the face f.
A faster version for this iteration demonstrates the following code snippet:
adjEntry adj1 = f->firstAdj(), adj = adj1; do { ... adj = adj->faceCycleSucc(); } while (adj != adj1);
Definition at line 477 of file CombinatorialEmbedding.h.
| #define forall_faces | ( | f, | |||
| E | ) | for((f)=(E).firstFace(); (f); (f)=(f)->succ()) |
Iteration over all faces f of the combinatorial embedding E.
Definition at line 459 of file CombinatorialEmbedding.h.
| #define forall_rev_faces | ( | f, | |||
| E | ) | for((f)=(E).lastFace(); (f); (f)=(f)->pred()) |
Iteration over all faces f of the combinatorial embedding E (in reverse order).
Definition at line 463 of file CombinatorialEmbedding.h.