Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files
 

Loading...
Searching...
No Matches
operations.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37
45
52inline void graphUnion(Graph& G1, const Graph& G2) { G1.insert(G2); }
53
69OGDF_EXPORT void graphUnion(Graph& G1, const Graph& G2, NodeArray<node>& map2to1,
70 bool parallelfree = false, bool directed = false);
71
72using NodeMap = NodeArray<NodeArray<node>>;
73
88OGDF_EXPORT void graphProduct(const Graph& G1, const Graph& G2, Graph& product,
89 NodeMap& nodeInProduct, const std::function<void(node, node)>& addEdges);
90
107OGDF_EXPORT void cartesianProduct(const Graph& G1, const Graph& G2, Graph& product,
108 NodeMap& nodeInProduct);
109
119OGDF_EXPORT void tensorProduct(const Graph& G1, const Graph& G2, Graph& product,
120 NodeMap& nodeInProduct);
121
134OGDF_EXPORT void lexicographicalProduct(const Graph& G1, const Graph& G2, Graph& product,
135 NodeMap& nodeInProduct);
136
150OGDF_EXPORT void strongProduct(const Graph& G1, const Graph& G2, Graph& product,
151 NodeMap& nodeInProduct);
152
162OGDF_EXPORT void coNormalProduct(const Graph& G1, const Graph& G2, Graph& product,
163 NodeMap& nodeInProduct);
164
176OGDF_EXPORT void modularProduct(const Graph& G1, const Graph& G2, Graph& product,
177 NodeMap& nodeInProduct);
178
187OGDF_EXPORT void rootedProduct(const Graph& G1, const Graph& G2, Graph& product,
188 NodeMap& nodeInProduct, node rootInG2);
189
191
194}
Graph.h
Includes declaration of graph class.
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
ogdf::NodeArray
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
ogdf::NodeElement
Class for the representation of nodes.
Definition Graph_d.h:177
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
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::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::graphUnion
void graphUnion(Graph &G1, const Graph &G2)
Forms the disjoint union of G1 and G2.
Definition operations.h:52
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 .
getDoubleFactoredZeroAdjustedMerger
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
Definition multilevelmixer.cpp:36
ogdf
The namespace for all OGDF objects.
Definition AugmentationModule.h:36