Open
Graph Drawing
Framework

#pragma once


#include <ogdf/basic/Graph.h>

#include <ogdf/basic/basic.h>


#include <functional>


namespace ogdf {


inline void graphUnion(Graph& G1, const Graph& G2) { G1.insert(G2); }


OGDF_EXPORT void graphUnion(Graph& G1, const Graph& G2, NodeArray<node>& map2to1,

        bool parallelfree = false, bool directed = false);


using NodeMap = NodeArray<NodeArray<node>>;


OGDF_EXPORT void graphProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct, const std::function<void(node, node)>& addEdges);


OGDF_EXPORT void cartesianProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void tensorProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void lexicographicalProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void strongProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void coNormalProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void modularProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct);


OGDF_EXPORT void rootedProduct(const Graph& G1, const Graph& G2, Graph& product,

        NodeMap& nodeInProduct, node rootInG2);


OGDF_EXPORT void complement(Graph& G, bool directed = false, bool allowSelfLoops = false);


OGDF_EXPORT void intersection(Graph& G1, const Graph& G2, const NodeArray<node>& nodeMap,

        bool directed = false);


OGDF_EXPORT void join(Graph& G1, const Graph& G2, NodeArray<node>& nodeMap, EdgeArray<edge>& edgeMap);


}

Graph.h
Includes declaration of graph class.

basic.h
Basic declarations, included by all source files.

ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866

ogdf::Graph::insert
std::pair< int, int > insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
Inserts a copy of a given subgraph into this graph.
Definition InducedSubgraph.h:102

ogdf::NodeElement
Class for the representation of nodes.
Definition Graph_d.h:241

ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717

ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659

OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117

ogdf::modularProduct
void modularProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the modular product of G1 and G2 and assigns it to product, with .

ogdf::join
void join(Graph &G1, const Graph &G2, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
Computes the graph join of G1 and G2.

ogdf::graphProduct
void graphProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct, const std::function< void(node, node)> &addEdges)
Computes the graph product of G1 and G2, using a given function to add edges.

ogdf::tensorProduct
void tensorProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the tensor product of G1 and G2 and assigns it to product, with .

ogdf::lexicographicalProduct
void lexicographicalProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the lexicographical product of G1 and G2 and assigns it to product, with .

ogdf::strongProduct
void strongProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the strong product of G1 and G2 and assigns it to product, with .

ogdf::coNormalProduct
void coNormalProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the co-normal product of G1 and G2 and assigns it to product, with .

ogdf::rootedProduct
void rootedProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct, node rootInG2)
Computes the rooted product of G1 and G2, rooted in rootInG2, and assigns it to product.

ogdf::complement
void complement(Graph &G, bool directed=false, bool allowSelfLoops=false)
Computes the complement of G.

ogdf::graphUnion
void graphUnion(Graph &G1, const Graph &G2)
Forms the disjoint union of G1 and G2.
Definition operations.h:55

ogdf::cartesianProduct
void cartesianProduct(const Graph &G1, const Graph &G2, Graph &product, NodeMap &nodeInProduct)
Computes the Cartesian product of G1 and G2 and assigns it to product, with .

ogdf::intersection
void intersection(Graph &G1, const Graph &G2, const NodeArray< node > &nodeMap, bool directed=false)
Computes the intersection of G1 and G2.

ogdf
The namespace for all OGDF objects.
Definition multilevelmixer.cpp:39