GraphUtils.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
 
#include <functional>
 
namespace ogdf {
template<class E>
class List;
} // namespace ogdf
 
namespace ogdf {
 
OGDF_EXPORT void moveEnd(Graph& G, edge e, node keep_end, node new_end);
 
OGDF_EXPORT void moveEnd(Graph& G, adjEntry keep_adj, adjEntry new_adj,
        Direction dir = Direction::after);
 
OGDF_EXPORT edge splitEdge(Graph& G, edge old_edge, node new_adj_to_source, node new_adj_to_target,
        edge new_edge = nullptr);
 
OGDF_EXPORT adjEntry splitEdge(Graph& G, adjEntry adj, node new_adj_to_node, node new_adj_to_twin,
        edge new_edge = nullptr);
 
OGDF_EXPORT bool joinEdge(Graph& G, edge u_e, edge v_e, node u, node v);
 
OGDF_EXPORT bool joinEdge(Graph& G, adjEntry u_adj, adjEntry v_adj, node u, node v);
 
OGDF_EXPORT bool joinEdge(Graph& G, edge u_e, edge v_e, node u, node v,
        const std::function<void(edge)>& deleteEdge);
 
OGDF_EXPORT bool joinEdge(Graph& G, adjEntry u_adj, adjEntry v_adj, node u, node v,
        const std::function<void(edge)>& deleteEdge);
 
OGDF_EXPORT void assertStarCentreAndRay(node centre, node ray);
 
OGDF_EXPORT node getCentreOfStar(node g_n);
 
enum class OrderComp { SAME, REVERSED, DIFFERENT };
 
OGDF_EXPORT OrderComp compareCyclicOrder(node n, List<adjEntry>& o, bool full_check = false);
 
OGDF_EXPORT void moveAdjToFront(Graph& G, adjEntry f);
 
OGDF_EXPORT void moveAdjToBack(Graph& G, adjEntry b);
 
}