Universal.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/CombinatorialEmbedding.h>
#include <ogdf/basic/Graph.h>
 
#include <cstddef>
#include <vector>
 
namespace ogdf {
namespace internal {
namespace gcm {
namespace tools {
 
inline bool equal(const node a, const node b) { return a->index() == b->index(); }
 
inline bool equal(const edge& a, const edge& b) {
    return equal(a->source(), b->source()) && equal(a->target(), b->target());
}
 
inline bool equal(const face& a, const face& b) { return a->index() == b->index(); }
 
inline std::vector<node> nodes_of_face(const face& face) {
    std::vector<node> nodes;
    adjEntry first = face->firstAdj();
    adjEntry current = first;
 
    do {
        nodes.push_back(current->theEdge()->source());
        current = face->nextFaceEdge(current);
    } while (current != first && current != NULL);
    return nodes;
}
 
}
}
}
}