Bijection.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/comparer.h>
#include <ogdf/cluster/sync_plan/basic/Iterators.h>
 
#include <functional>
#include <utility>
 
namespace ogdf::sync_plan {
 
using PipeBijIterator = ZipIterator<ogdf::internal::GraphObjectContainer<AdjElement>::iterator,
        ogdf::internal::GraphObjectContainer<AdjElement>::reverse_iterator>;
using PipeBijRange = Range<PipeBijIterator>;
using PipeBijPair = std::pair<adjEntry, adjEntry>;
using FrozenPipeBijPair = std::pair<int, int>;
using PipeBij = List<PipeBijPair>;
using FrozenPipeBij = List<FrozenPipeBijPair>;
 
OGDF_DECLARE_COMPARER(PipeBijCmp, PipeBijPair, int, x.first->theEdge()->index());
 
OGDF_DECLARE_COMPARER(FrozenPipeBijCmp, FrozenPipeBijPair, int, x.first);
 
OGDF_EXPORT PipeBijRange getPipeBijection(node u, node v);
 
OGDF_EXPORT void getPipeBijection(node u, node v, PipeBij& out);
 
OGDF_EXPORT void getPipeBijection(node u, node v, AdjEntryArray<adjEntry>& out);
 
OGDF_EXPORT void getPipeBijection(node u, node v, EdgeArray<edge>& out);
 
OGDF_EXPORT void getFrozenPipeBijection(node u, node v, FrozenPipeBij& out);
 
OGDF_EXPORT void freezePipeBijection(const PipeBij& in, FrozenPipeBij& out);
 
OGDF_EXPORT std::pair<node, node> split(Graph& G, sync_plan::PipeBij& bij,
        const EdgeArray<edge>* new_edges = nullptr, const EdgeArray<bool>* reverse_edges = nullptr,
        node src = nullptr, node tgt = nullptr);
 
OGDF_EXPORT void join(Graph& G, node u, node v, sync_plan::PipeBij& bij,
        List<bool>* reverse_v = nullptr);
 
OGDF_EXPORT void join(Graph& G, node u, node v, sync_plan::PipeBij& bij,
        const std::function<void(node)>& deleteNode, const std::function<void(edge)>& deleteEdge,
        List<bool>* reverse_v = nullptr);
 
}