Uses of Interface com.jgalgo.graph.GraphFactory (JGAlgo - Parent 0.5.1-SNAPSHOT API)

Packages that use GraphFactory
Package	Description
com.jgalgo.gen	Graph generators used to generate (possibly random) graphs with different distributions and structures.
com.jgalgo.graph	Graphs object are the fundamental building blocks of the JGAlgo library.

Uses of GraphFactory in com.jgalgo.gen

Methods in com.jgalgo.gen that return GraphFactory
Modifier and Type	Method	Description
`GraphFactory<V,E>`	BarabasiAlbertGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	ComplementGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	CompleteBipartiteGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	CompleteGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	DifferenceGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	EmptyGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	GnmBipartiteGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	GnmGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	GnpBipartiteGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	GnpGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	IntersectionGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	LineGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	RecursiveMatrixGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	SymmetricDifferenceGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	UniformTreeGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).
`GraphFactory<V,E>`	UnionGraphGenerator.`graphFactory()`	Get the graph factory that will be used to create the generated graph(s).

Constructors in com.jgalgo.gen with parameters of type GraphFactory
Constructor	Description
`BarabasiAlbertGraphGenerator(GraphFactory<V,E> factory)`	Create a new Barabasi-Albert graph generator that will use the given graph factory.
`ComplementGraphGenerator(GraphFactory<V,E> factory)`	Create a new complement graph generator that will use the given graph factory.
`CompleteBipartiteGraphGenerator(GraphFactory<V,E> factory)`	Create a new complete bipartite graph generator that will use the given graph factory.
`CompleteGraphGenerator(GraphFactory<V,E> factory)`	Create a new complete graph generator that will use the given graph factory.
`DifferenceGraphGenerator(GraphFactory<V,E> factory)`	Create a new difference graph generator that will use the given graph factory.
`EmptyGraphGenerator(GraphFactory<V,E> factory)`	Create a new empty generator that will use the given graph factory.
`GnmBipartiteGraphGenerator(GraphFactory<V,E> factory)`	Create a new \(G(n_1,n_2,m)\) generator that will use the given graph factory.
`GnmGraphGenerator(GraphFactory<V,E> factory)`	Create a new \(G(n,m)\) generator that will use the given graph factory.
`GnpBipartiteGraphGenerator(GraphFactory<V,E> factory)`	Create a new \(G(n_1,n_2,p)\) graph generator that will use the given graph factory.
`GnpGraphGenerator(GraphFactory<V,E> factory)`	Create a new \(G(n,p)\) graph generator that will use the given graph factory.
`IntersectionGraphGenerator(GraphFactory<V,E> factory)`	Create a new intersection graph generator that will use the given graph factory.
`LineGraphGenerator(GraphFactory<V,E> factory)`	Create a new line graph generator that will use the given graph factory.
`RecursiveMatrixGraphGenerator(GraphFactory<V,E> factory)`	Create a new R-MAT generator that will use the given graph factory.
`SymmetricDifferenceGraphGenerator(GraphFactory<V,E> factory)`	Create a new symmetric difference graph generator that will use the given graph factory.
`UniformTreeGenerator(GraphFactory<V,E> factory)`	Create a new uniform tree generator that will use the given graph factory.
`UnionGraphGenerator(GraphFactory<V,E> factory)`	Create a new union graph generator that will use the given graph factory.

Uses of GraphFactory in com.jgalgo.graph

Subinterfaces of GraphFactory in com.jgalgo.graph
Modifier and Type	Interface	Description
`interface`	`IndexGraphFactory`	A factory for Index graphs.
`interface`	`IntGraphFactory`	A factory for `IntGraph` objects.

Methods in com.jgalgo.graph that return GraphFactory
Modifier and Type	Method	Description
`GraphFactory<V,E>`	GraphFactory.`addHint(GraphFactory.Hint hint)`	Add a hint to this factory.
`default GraphFactory<V,E>`	GraphFactory.`allowParallelEdges()`	Change the config of this factory so that the built graphs will support parallel edges.
`GraphFactory<V,E>`	GraphFactory.`allowParallelEdges(boolean parallelEdges)`	Determine if graphs built by this factory should be support parallel edges.
`default GraphFactory<V,E>`	GraphFactory.`allowSelfEdges()`	Change the config of this factory so that the built graphs will support self edges.
`GraphFactory<V,E>`	GraphFactory.`allowSelfEdges(boolean selfEdges)`	Determine if graphs built by this factory should be support self edges.
`static <V,E> GraphFactory<V,E>`	GraphFactory.`directed()`	Create a directed graph factory.
`GraphFactory<V,E>`	GraphFactory.`expectedEdgesNum(int expectedEdgesNum)`	Set the expected number of edges that will exist in the graph.
`GraphFactory<V,E>`	GraphFactory.`expectedVerticesNum(int expectedVerticesNum)`	Set the expected number of vertices that will exist in the graph.
`static <V,E> GraphFactory<V,E>`	GraphFactory.`newInstance(boolean directed)`	Create a new un/directed graph factory.
`GraphFactory<V,E>`	GraphFactory.`removeHint(GraphFactory.Hint hint)`	Remove a hint from this factory.
`GraphFactory<V,E>`	GraphFactory.`setDirected(boolean directed)`	Determine if graphs built by this factory should be directed.
`default GraphFactory<V,E>`	GraphFactory.`setEdgeBuilder(IdBuilder<E> edgeBuilder)`	Set the edge builder used by the built graph(s).
`GraphFactory<V,E>`	GraphFactory.`setEdgeFactory(Supplier<? extends IdBuilder<E>> edgeFactory)`	Set the edge factory which create builders for the edges of the built graph(s).
`default GraphFactory<V,E>`	GraphFactory.`setOption(String key, Object value)`	[TL;DR Don't call me!]
`default GraphFactory<V,E>`	GraphFactory.`setVertexBuilder(IdBuilder<V> vertexBuilder)`	Set the vertex builder used by the built graph(s).
`GraphFactory<V,E>`	GraphFactory.`setVertexFactory(Supplier<? extends IdBuilder<V>> vertexFactory)`	Set the vertex factory which create builders for the vertices of the built graph(s).
`static <V,E> GraphFactory<V,E>`	GraphFactory.`undirected()`	Create an undirected graph factory.