50 using QElement = std::pair<ogdf::node, unsigned int>;
75 for (
auto v : vertex_order) {
85 for (
auto v : vertex_order) {
Declaration of class GraphAttributes which extends a Graph by additional attributes.
std::vector< QElement > vertex_order
List< node > get_vertex_order()
CrossingVertexOrder(GraphAttributes &_ga, OrderEnum _o, MeasureEnum _m)
std::pair< ogdf::node, unsigned int > QElement
List< node > get_vertex_order_by_crossed_edges(edge e)
Class for the representation of edges.
Stores additional attributes of a graph (like layout information).
Doubly linked lists (maintaining the length of the list).
iterator pushBack(const E &x)
Adds element x at the end of the list.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.