VertexOrder.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
 
#include <utility>
#include <vector>
 
namespace ogdf {
 
enum class OrderEnum { asc, desc, rnd };
enum class MeasureEnum { zero, log, sum, squared };
 
class OGDF_EXPORT CrossingVertexOrder {
private:
    GraphAttributes ga;
 
    using QElement = std::pair<ogdf::node, unsigned int>;
 
    std::vector<QElement> vertex_order;
    OrderEnum o;
    MeasureEnum m;
 
    void sort();
 
    double crossings(int c);
 
    void init_all();
    void init();
 
 
    void init_cr(edge e);
 
public:
    CrossingVertexOrder(GraphAttributes& _ga, OrderEnum _o, MeasureEnum _m)
        : ga(_ga), o(_o), m(_m) {
        //nothing to do
    }
 
    List<node> get_vertex_order() {
        init();
        List<node> order;
        for (auto v : vertex_order) {
            order.pushBack(v.first);
        }
        return order;
    }
 
    List<node> get_vertex_order_by_crossed_edges(edge e) {
        vertex_order.clear();
        init_cr(e);
        List<node> order;
        for (auto v : vertex_order) {
            order.pushBack(v.first);
        }
        return order;
    }
};
}