Declaration of deterministic graph generators. More...
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <utility>
Go to the source code of this file.
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
Functions | |
Deterministic graph generators | |
void | ogdf::circulantGraph (Graph &G, int n, Array< int > jumps) |
Creates a circulant graph. More... | |
void | ogdf::completeBipartiteGraph (Graph &G, int n, int m) |
Creates the complete bipartite graph K_{n,m}. More... | |
void | ogdf::completeGraph (Graph &G, int n) |
Creates the complete graph K_n. More... | |
void | ogdf::completeKPartiteGraph (Graph &G, const Array< int > &signature) |
Creates the complete k-partite graph K_{k1,k2,...,kn}. More... | |
void | ogdf::cubeGraph (Graph &G, int n) |
Creates the graph Q^n: A n -cube graph. More... | |
void | ogdf::customGraph (Graph &G, int n, List< std::pair< int, int >> edges) |
Creates a custom graph using a list of pairs to determine the graph's edges. More... | |
void | ogdf::customGraph (Graph &G, int n, List< std::pair< int, int >> edges, Array< node > &nodes) |
Creates a custom graph using a list of pairs to determine the graph's edges. More... | |
void | ogdf::emptyGraph (Graph &G, int nodes) |
Creates a graph with nodes nodes and no edges. More... | |
void | ogdf::globeGraph (Graph &G, int meridians, int latitudes) |
Creates a globe graph with a given number of meridians and latitudes. More... | |
void | ogdf::gridGraph (Graph &G, int n, int m, bool loopN, bool loopM) |
Creates a (toroidal) grid graph on n x m nodes. More... | |
void | ogdf::petersenGraph (Graph &G, int n=5, int m=2) |
Creates a generalized Petersen graph. More... | |
void | ogdf::regularLatticeGraph (Graph &G, int n, int k) |
Creates a regular lattice graph. More... | |
void | ogdf::regularTree (Graph &G, int n, int children) |
Creates a regular tree. More... | |
void | ogdf::suspension (Graph &G, int s) |
Modifies G by adding its s -th suspension. More... | |
void | ogdf::wheelGraph (Graph &G, int n) |
Creates the graph W_n: A wheel graph. More... | |
Deterministic graph generators | |
void | ogdf::customGraph (Graph &G, int n, List< std::pair< int, int >> edges, Array< node > &nodes) |
Creates a custom graph using a list of pairs to determine the graph's edges. More... | |
void | ogdf::customGraph (Graph &G, int n, List< std::pair< int, int >> edges) |
Creates a custom graph using a list of pairs to determine the graph's edges. More... | |
void | ogdf::circulantGraph (Graph &G, int n, Array< int > jumps) |
Creates a circulant graph. More... | |
void | ogdf::regularLatticeGraph (Graph &G, int n, int k) |
Creates a regular lattice graph. More... | |
void | ogdf::regularTree (Graph &G, int n, int children) |
Creates a regular tree. More... | |
void | ogdf::completeGraph (Graph &G, int n) |
Creates the complete graph K_n. More... | |
void | ogdf::completeKPartiteGraph (Graph &G, const Array< int > &signature) |
Creates the complete k-partite graph K_{k1,k2,...,kn}. More... | |
void | ogdf::completeBipartiteGraph (Graph &G, int n, int m) |
Creates the complete bipartite graph K_{n,m}. More... | |
void | ogdf::wheelGraph (Graph &G, int n) |
Creates the graph W_n: A wheel graph. More... | |
void | ogdf::cubeGraph (Graph &G, int n) |
Creates the graph Q^n: A n -cube graph. More... | |
void | ogdf::globeGraph (Graph &G, int meridians, int latitudes) |
Creates a globe graph with a given number of meridians and latitudes. More... | |
void | ogdf::suspension (Graph &G, int s) |
Modifies G by adding its s -th suspension. More... | |
void | ogdf::gridGraph (Graph &G, int n, int m, bool loopN, bool loopM) |
Creates a (toroidal) grid graph on n x m nodes. More... | |
void | ogdf::petersenGraph (Graph &G, int n=5, int m=2) |
Creates a generalized Petersen graph. More... | |
void | ogdf::emptyGraph (Graph &G, int nodes) |
Creates a graph with nodes nodes and no edges. More... | |
Declaration of deterministic graph generators.
Definition in file deterministic.h.