Uses of Class
org.graph4j.generators.AbstractGraphGenerator
Packages that use AbstractGraphGenerator
-
Uses of AbstractGraphGenerator in org.graph4j.generators
Subclasses of AbstractGraphGenerator in org.graph4j.generatorsModifier and TypeClassDescriptionclassclassGenerator for complete bipartite graphs.classGenerates complete graphs or digraphs.classGenerator for complete multipartite graphs.classGenerates complete trees.classA cycle graph consists of a single cycle.classGenerates fan graphs.classA two-dimensional m x n grid graph is the Cartesian product of the path graphs Pm and Pn (m is the number of rows, n is the number of columns).classclassGenerates Mycielski graphs.classA path graph consists of a single path.classGenerates a random chordal graph.classGenerates a random directed acyclic graph (DAG).classGenerates a random forest.classRandom bipartite graph generator using Erdős–Rényi G(n,m) model.classErdős–Rényi G(n,m) model.classRandom bipartite graph generator using Erdős–Rényi G(n,p) model.classGenerator for Erdős–Rényi G(n,p) model.classCreates a random Hamiltonian graph or digraph.classGenerates a random k-Nearest Neighbor Graph (KNNG).classGenerates a random layered graph.classGenerator for random multipartite graphs.classGenerates a random simple undirected graph that satisfies Ore's condition:deg(v) + deg(u) >= |V(G)|, for every pair of distinct non-adjacent vertices v and u.classGenerates a random tree or arborescence.classGenerates random unit disk graphs.classGenerates a regular graph.classA star is a graph formed by connecting a single universal vertex, called center, to an independent set of vertices.classGenerates a tournament graph.classThe Watts–Strogatz model produces graphs with small-world properties, including short average path lengths and high clustering.classGenerator for wheel graphs.