deterministic.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
 
#include <utility>
 
namespace ogdf {
 
 
OGDF_EXPORT void customGraph(Graph& G, int n, List<std::pair<int, int>> edges, Array<node>& nodes);
 
 
inline void customGraph(Graph& G, int n, List<std::pair<int, int>> edges) {
    Array<node> nodes;
    customGraph(G, n, edges, nodes);
}
 
 
OGDF_EXPORT void circulantGraph(Graph& G, int n, Array<int> jumps);
 
 
OGDF_EXPORT void regularLatticeGraph(Graph& G, int n, int k);
 
 
OGDF_EXPORT void regularTree(Graph& G, int n, int children);
 
 
OGDF_EXPORT void completeGraph(Graph& G, int n);
 
 
OGDF_EXPORT void completeKPartiteGraph(Graph& G, const Array<int>& signature);
 
 
OGDF_EXPORT void completeBipartiteGraph(Graph& G, int n, int m);
 
 
OGDF_EXPORT void wheelGraph(Graph& G, int n);
 
 
OGDF_EXPORT void cubeGraph(Graph& G, int n);
 
 
OGDF_EXPORT void globeGraph(Graph& G, int meridians, int latitudes);
 
 
OGDF_EXPORT void suspension(Graph& G, int s);
 
 
OGDF_EXPORT void gridGraph(Graph& G, int n, int m, bool loopN, bool loopM);
 
 
OGDF_EXPORT void petersenGraph(Graph& G, int n = 5, int m = 2);
 
 
OGDF_EXPORT void emptyGraph(Graph& G, int nodes);
 
 
}