Interface IndexGraphFactory
- All Superinterfaces:
GraphFactory<Integer,
,Integer> IntGraphFactory
The factory can be used to create new empty graphs, with different options and capabilities. Few methods are available to optimize the graph implementation choice. The factory can also be used to create a copy of an existing graphs, with the same vertices and edges, with/without copying the vertices/edges weights.
Both the graph factory and IndexGraphBuilder
are used to create new graphs. The difference is that vertices
and edges can be added to the builder, which is then used to construct non empty graphs, while the factory is only
used to choose a graph implementation and create an empty graph.
This interface is a specification of IntGraphFactory
for IndexGraph
.
- Author:
- Barak Ugav
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from interface com.jgalgo.graph.GraphFactory
GraphFactory.Hint
-
Method Summary
Modifier and TypeMethodDescriptionaddHint
(GraphFactory.Hint hint) Add a hint to this factory.default IndexGraphFactory
Change the config of this factory so that the built graphs will support parallel edges.allowParallelEdges
(boolean parallelEdges) Determine if graphs built by this factory should be support parallel edges.default IndexGraphFactory
Change the config of this factory so that the built graphs will support self edges.allowSelfEdges
(boolean selfEdges) Determine if graphs built by this factory should be support self edges.static IndexGraphFactory
directed()
Create a directed index graph factory.expectedEdgesNum
(int expectedEdgesNum) Set the expected number of edges that will exist in the graph.expectedVerticesNum
(int expectedVerticesNum) Set the expected number of vertices that will exist in the graph.Create a new graph builder with the factory parameters.default IndexGraphBuilder
Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, without copying the weights.newBuilderCopyOf
(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, with/without copying the weights.default IndexGraph
Create a copy of a given graph, with the same vertices and edges, without copying weights.Create a copy of a given graph, with the same vertices and edges, with/without copying weights.newGraph()
Create a new empty graph.default IndexGraph
Create a new immutable copy of a given graph, with the same vertices and edges, without copying weights.newImmutableCopyOf
(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) Create a new immutable copy of a given graph, with the same vertices and edges, with/without copying weights.static IndexGraphFactory
newInstance
(boolean directed) Create a new un/directed index graph factory.removeHint
(GraphFactory.Hint hint) Remove a hint from this factory.setDirected
(boolean directed) Determine if graphs built by this factory should be directed.default IndexGraphFactory
setEdgeBuilder
(IdBuilder<Integer> edgeBuilder) Deprecated.Index graphs does not support custom edge builderdefault IndexGraphFactory
setEdgeFactory
(Supplier<? extends IdBuilder<Integer>> edgeFactory) Deprecated.Index graphs does not support custom edge builderdefault IndexGraphFactory
[TL;DR Don't call me!] Set an option.default IndexGraphFactory
setVertexBuilder
(IdBuilder<Integer> vertexBuilder) Deprecated.Index graphs does not support custom vertex builderdefault IndexGraphFactory
setVertexFactory
(Supplier<? extends IdBuilder<Integer>> vertexFactory) Deprecated.Index graphs does not support custom vertex builderstatic IndexGraphFactory
Create an undirected index graph factory.
-
Method Details
-
newGraph
IndexGraph newGraph()Description copied from interface:GraphFactory
Create a new empty graph.- Specified by:
newGraph
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newGraph
in interfaceIntGraphFactory
- Returns:
- a new graph with the factory options
-
newCopyOf
Description copied from interface:GraphFactory
Create a copy of a given graph, with the same vertices and edges, without copying weights.An identical copy of the given graph will be created, with the same vertices and edges, without copying the vertices/edges weights. The returned Graph will always be mutable, with no side affects on the original graph.
Differing from
Graph.copy()
, the capabilities of the new graph are determined by the factory configuration, rather than copied from the given graph. Note for example that if the factory chooses to use an implementation that does not support self edges (ifGraphFactory.allowSelfEdges(boolean)
was not called withtrue
), attempting to create a copy of a graph that does contains self edges will result in an exception.For an immutable copy of a graph, see
GraphFactory.newImmutableCopyOf(Graph, boolean, boolean)
.- Specified by:
newCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- the original graph to copy- Returns:
- an identical copy of the given graph, with the same vertices and edges, without the original graph weights
-
newCopyOf
IndexGraph newCopyOf(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) Description copied from interface:GraphFactory
Create a copy of a given graph, with the same vertices and edges, with/without copying weights.An identical copy of the given graph will be created, with the same vertices and edges, with/without copying the vertices/edges weights. The returned Graph will always be mutable, with no side affects on the original graph.
Differing from
Graph.copy(boolean, boolean)
, the capabilities of the new graph are determined by the factory configuration, rather than copied from the given graph. Note for example that if the factory chooses to use an implementation that does not support self edges (ifGraphFactory.allowSelfEdges(boolean)
was not called withtrue
), attempting to create a copy of a graph that does contains self edges will result in an exception.For an immutable copy of a graph, see
GraphFactory.newImmutableCopyOf(Graph, boolean, boolean)
.- Specified by:
newCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- the original graph to copycopyVerticesWeights
- iftrue
, the weights of the vertices will be copied to the new graphcopyEdgesWeights
- iftrue
, the weights of the edges will be copied to the new graph- Returns:
- an identical copy of the given graph, with the same vertices and edges, with/without the original graph weights
-
newImmutableCopyOf
Description copied from interface:GraphFactory
Create a new immutable copy of a given graph, with the same vertices and edges, without copying weights.An identical copy of the given graph will be created, with the same vertices and edges, without copying the vertices/edges weights. The returned Graph will be immutable, with no side affects on the original graph.
Differing from
Graph.immutableCopy()
, the capabilities of the new graph are determined by the factory configuration, rather than copied from the given graph. Note for example that if the factory chooses to use an implementation that does not support self edges (ifGraphFactory.allowSelfEdges(boolean)
was not called withtrue
), attempting to create a copy of a graph that does contains self edges will result in an exception.For a mutable copy of a graph, see
GraphFactory.newCopyOf(Graph, boolean, boolean)
.- Specified by:
newImmutableCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newImmutableCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- the original graph to copy- Returns:
- an identical immutable copy of the given graph, with the same vertices and edges, without the original graph weights
-
newImmutableCopyOf
IndexGraph newImmutableCopyOf(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) Description copied from interface:GraphFactory
Create a new immutable copy of a given graph, with the same vertices and edges, with/without copying weights.An identical copy of the given graph will be created, with the same vertices and edges, with/without copying the vertices/edges weights. The returned Graph will be immutable, with no side affects on the original graph.
Differing from
Graph.immutableCopy(boolean, boolean)
, the capabilities of the new graph are determined by the factory configuration, rather than copied from the given graph. Note for example that if the factory chooses to use an implementation that does not support self edges (ifGraphFactory.allowSelfEdges(boolean)
was not called withtrue
), attempting to create a copy of a graph that does contains self edges will result in an exception.For a mutable copy of a graph, see
GraphFactory.newCopyOf(Graph, boolean, boolean)
.- Specified by:
newImmutableCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newImmutableCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- the original graph to copycopyVerticesWeights
- iftrue
, the weights of the vertices will be copied to the new graphcopyEdgesWeights
- iftrue
, the weights of the edges will be copied to the new graph- Returns:
- an identical immutable copy of the given graph, with the same vertices and edges, without the original graph weights
-
newBuilder
IndexGraphBuilder newBuilder()Description copied from interface:GraphFactory
Create a new graph builder with the factory parameters.The created builder can be used to add vertices and edges, and then build a (mutable or immutable) non empty graph, differing from the factory which only builds empty graphs. The capabilities such as un/directed, support of self edges, support of parallel edges, and hints such as expected number of vertices and edges, other hints, etc. are copied from the factory to the builder.
- Specified by:
newBuilder
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newBuilder
in interfaceIntGraphFactory
- Returns:
- a new graph builder with the factory parameters
-
newBuilderCopyOf
Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, without copying the weights.If the given graph is directed, the new builder will build directed graphs, and similarly for undirected graphs.
The given graph vertices and edges must be
0,1,2,...,verticesNum-1
and0,1,2,...,edgesNum-1
respectively.- Specified by:
newBuilderCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newBuilderCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- a graph- Returns:
- a graph builder with the factory parameters initialized with the given graph vertices and edges, without the original graph vertices/edges weights.
- Throws:
IllegalArgumentException
- if the vertices are not0,1,2,...,verticesNum-1
or if the edges are not0,1,2,...,edgesNum-1
-
newBuilderCopyOf
IndexGraphBuilder newBuilderCopyOf(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) Create a new graph builder with the factory parameters initialized with an existing graph vertices and edges, with/without copying the weights.If the given graph is directed, the new builder will build directed graphs, and similarly for undirected graphs.
The given graph vertices and edges must be
0,1,2,...,verticesNum-1
and0,1,2,...,edgesNum-1
respectively.- Specified by:
newBuilderCopyOf
in interfaceGraphFactory<Integer,
Integer> - Specified by:
newBuilderCopyOf
in interfaceIntGraphFactory
- Parameters:
g
- a graphcopyVerticesWeights
- iftrue
, the weights of the vertices will be copied from the graph to the buildercopyEdgesWeights
- iftrue
, the weights of the edges will be copied from the graph to the builder- Returns:
- a graph builder with the factory parameters initialized with the given graph vertices and edges, with/without the original graph vertices/edges weights.
- Throws:
IllegalArgumentException
- if the vertices are not0,1,2,...,verticesNum-1
or if the edges are not0,1,2,...,edgesNum-1
-
setDirected
Description copied from interface:GraphFactory
Determine if graphs built by this factory should be directed.Usually the factory will be created using either
GraphFactory.directed()
orGraphFactory.undirected()
, and there will be no need to call this method. However, it is sometimes useful use the same factory to build both directed and undirected graphs, and this method can be used to change the factory configuration. For example, a factory can be passed to a random graph generator, which can generated both directed and undirected graphs, depending on the generator parameters.- Specified by:
setDirected
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setDirected
in interfaceIntGraphFactory
- Parameters:
directed
- iftrue
graphs built by this factory will be directed, else they will be undirected- Returns:
- this factory
-
allowSelfEdges
Description copied from interface:GraphFactory
Change the config of this factory so that the built graphs will support self edges.By default, graphs built by this factory will not support self edges.
- Specified by:
allowSelfEdges
in interfaceGraphFactory<Integer,
Integer> - Specified by:
allowSelfEdges
in interfaceIntGraphFactory
- Returns:
- this factory
-
allowSelfEdges
Description copied from interface:GraphFactory
Determine if graphs built by this factory should be support self edges.By default, graphs built by this factory will not support self edges.
- Specified by:
allowSelfEdges
in interfaceGraphFactory<Integer,
Integer> - Specified by:
allowSelfEdges
in interfaceIntGraphFactory
- Parameters:
selfEdges
- iftrue
graphs built by this factory will support self edges, else they will not- Returns:
- this factory
-
allowParallelEdges
Description copied from interface:GraphFactory
Change the config of this factory so that the built graphs will support parallel edges.By default, graphs built by this factory will support parallel edges. The reason is that in order to enforce no parallel edges are added to the graph, an efficient lookup of edges (keyed by an edge's vertices) is required, which is an operation most graph algorithms do not use and therefore most implementations are not optimized for. See
GraphFactory.Hint.FastEdgeLookup
.- Specified by:
allowParallelEdges
in interfaceGraphFactory<Integer,
Integer> - Specified by:
allowParallelEdges
in interfaceIntGraphFactory
- Returns:
- this factory
-
allowParallelEdges
Description copied from interface:GraphFactory
Determine if graphs built by this factory should be support parallel edges.By default, graphs built by this factory will support parallel edges. The reason is that in order to enforce no parallel edges are added to the graph, an efficient lookup of edges (keyed by an edge's vertices) is required, which is an operation most graph algorithms do not use and therefore most implementations are not optimized for. See
GraphFactory.Hint.FastEdgeLookup
.- Specified by:
allowParallelEdges
in interfaceGraphFactory<Integer,
Integer> - Specified by:
allowParallelEdges
in interfaceIntGraphFactory
- Parameters:
parallelEdges
- iftrue
graphs built by this factory will support parallel edges, else they will not- Returns:
- this factory
-
expectedVerticesNum
Description copied from interface:GraphFactory
Set the expected number of vertices that will exist in the graph.- Specified by:
expectedVerticesNum
in interfaceGraphFactory<Integer,
Integer> - Specified by:
expectedVerticesNum
in interfaceIntGraphFactory
- Parameters:
expectedVerticesNum
- the expected number of vertices in the graph- Returns:
- this factory
-
expectedEdgesNum
Description copied from interface:GraphFactory
Set the expected number of edges that will exist in the graph.- Specified by:
expectedEdgesNum
in interfaceGraphFactory<Integer,
Integer> - Specified by:
expectedEdgesNum
in interfaceIntGraphFactory
- Parameters:
expectedEdgesNum
- the expected number of edges in the graph- Returns:
- this factory
-
setVertexBuilder
Deprecated.Index graphs does not support custom vertex builderUnsupported operation, index graphs does not support custom vertex builder.- Specified by:
setVertexBuilder
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setVertexBuilder
in interfaceIntGraphFactory
- Parameters:
vertexBuilder
- the vertex builder, ornull
if no vertex builder should be used- Returns:
- this factory
- Throws:
UnsupportedOperationException
- always
-
setVertexFactory
@Deprecated default IndexGraphFactory setVertexFactory(Supplier<? extends IdBuilder<Integer>> vertexFactory) Deprecated.Index graphs does not support custom vertex builderUnsupported operation, index graphs does not support custom vertex builder.- Specified by:
setVertexFactory
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setVertexFactory
in interfaceIntGraphFactory
- Parameters:
vertexFactory
- the vertex factory, ornull
if no vertex builder should be used- Returns:
- this factory
- Throws:
UnsupportedOperationException
- always
-
setEdgeBuilder
Deprecated.Index graphs does not support custom edge builderUnsupported operation, index graphs does not support custom edge builder.- Specified by:
setEdgeBuilder
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setEdgeBuilder
in interfaceIntGraphFactory
- Parameters:
edgeBuilder
- the edge builder, ornull
if no edge builder should be used- Returns:
- this factory
- Throws:
UnsupportedOperationException
- always
-
setEdgeFactory
@Deprecated default IndexGraphFactory setEdgeFactory(Supplier<? extends IdBuilder<Integer>> edgeFactory) Deprecated.Index graphs does not support custom edge builderUnsupported operation, index graphs does not support custom edge builder.- Specified by:
setEdgeFactory
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setEdgeFactory
in interfaceIntGraphFactory
- Parameters:
edgeFactory
- the edge factory, ornull
if no edge builder should be used- Returns:
- this factory
- Throws:
UnsupportedOperationException
- always
-
addHint
Description copied from interface:GraphFactory
Add a hint to this factory.Hints do not change the behavior of the graphs built by this factory, by may affect performance.
- Specified by:
addHint
in interfaceGraphFactory<Integer,
Integer> - Specified by:
addHint
in interfaceIntGraphFactory
- Parameters:
hint
- the hint to add- Returns:
- this factory
-
removeHint
Description copied from interface:GraphFactory
Remove a hint from this factory.Hints do not change the behavior of the graphs built by this factory, by may affect performance.
- Specified by:
removeHint
in interfaceGraphFactory<Integer,
Integer> - Specified by:
removeHint
in interfaceIntGraphFactory
- Parameters:
hint
- the hint to remove- Returns:
- this factory
-
undirected
Create an undirected index graph factory.- Returns:
- a new factory that can build undirected index graphs
-
directed
Create a directed index graph factory.- Returns:
- a new factory that can build directed index graphs
-
newInstance
Create a new un/directed index graph factory.- Parameters:
directed
- whether the graphs created by the factory should be directed- Returns:
- a new factory that can build un/directed index graphs
-
setOption
Description copied from interface:GraphFactory
[TL;DR Don't call me!] Set an option.The builder might support different options to customize its implementation. These options never change the behavior of the algorithm, only its internal implementation. The possible options are not exposed as 'public' because they are not part of the API and may change in the future.
These options are mainly for debug and benchmark purposes.
- Specified by:
setOption
in interfaceGraphFactory<Integer,
Integer> - Specified by:
setOption
in interfaceIntGraphFactory
- Parameters:
key
- the option keyvalue
- the option value- Returns:
- this builder
-