Package org.graph4j.generators
package org.graph4j.generators
Graph generators of various kinds.
-
ClassesClassDescriptionThe Barabási–Albert (BA) model generates random scale-free networks using a preferential attachment mechanism.Generator for complete bipartite graphs.Generates complete graphs or digraphs.Generator for complete multipartite graphs.Generates complete trees.A cycle graph consists of a single cycle.Generates costs for the edges of a network.Generates weights for the edges of a graph.Generates fan graphs.Static methods for generating various standard graphs.A 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).Generates Mycielski graphs.A path graph consists of a single path.Generates a random chordal graph.Generates a random directed acyclic graph (DAG).Generates a random forest.Random bipartite graph generator using Erdős–Rényi G(n,m) model.Erdős–Rényi G(n,m) model.Random bipartite graph generator using Erdős–Rényi G(n,p) model.Generator for Erdős–Rényi G(n,p) model.Creates a random Hamiltonian graph or digraph.Generates a random k-Nearest Neighbor Graph (KNNG).Generates a random layered graph.Generator for random multipartite graphs.Generates 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.Generates a random tree or arborescence.Generates random unit disk graphs.Generates a regular graph.A star is a graph formed by connecting a single universal vertex, called center, to an independent set of vertices.Generates a tournament graph.Generates weights for the vertices of a graph.The Watts–Strogatz model produces graphs with small-world properties, including short average path lengths and high clustering.Generator for wheel graphs.