Cycle.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
 
#include <tuple>
#include <unordered_set>
#include <vector>
 
namespace ogdf {
namespace matching_blossom {
 
class OGDF_EXPORT Cycle {
private:
    std::unordered_set<node> m_nodes;
 
    std::vector<edge> m_edgeOrder;
 
    std::vector<long> indexOf(std::vector<node> nodesToFind);
 
public:
    Cycle(edge startEdge);
 
    /* Getters */
 
    const std::vector<edge>& edgeOrder();
 
    const std::unordered_set<node>& nodes();
 
    /* End of getters */
 
    void addEdge(edge e);
 
    node startNode();
 
    std::tuple<long, long> indexOf(node u, node v);
 
    long indexOf(node u);
 
    bool contains(node v);
};
 
}
}