Package com.jgalgo.graph

Interface IndexGraphFactory

  • All Superinterfaces:
    GraphFactory<Integer,​Integer>, IntGraphFactory
    public interface IndexGraphFactory
extends IntGraphFactory
    A factory for Index graphs.

    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 specific version of IntGraphFactory for IndexGraph.

    Author:
    Barak Ugav
    See Also:
    directed(), undirected(), IndexGraph, IndexGraphBuilder

    • Method Detail

      • newCopyOf

        default IndexGraph newCopyOf​(Graph<Integer,​Integer> g)
        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 (if GraphFactory.allowSelfEdges(boolean) was not called with true), 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        newCopyOf in interface IntGraphFactory
        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 (if GraphFactory.allowSelfEdges(boolean) was not called with true), 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        newCopyOf in interface IntGraphFactory
        Parameters:
        g - the original graph to copy
        copyVerticesWeights - if true, the weights of the vertices will be copied to the new graph
        copyEdgesWeights - if true, 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

        default IndexGraph newImmutableCopyOf​(Graph<Integer,​Integer> g)
        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 (if GraphFactory.allowSelfEdges(boolean) was not called with true), 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        newImmutableCopyOf in interface IntGraphFactory
        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 (if GraphFactory.allowSelfEdges(boolean) was not called with true), 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        newImmutableCopyOf in interface IntGraphFactory
        Parameters:
        g - the original graph to copy
        copyVerticesWeights - if true, the weights of the vertices will be copied to the new graph
        copyEdgesWeights - if true, 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        newBuilder in interface IntGraphFactory
        Returns:
        a new graph builder with the factory parameters

      • newBuilderCopyOf

        default IndexGraphBuilder newBuilderCopyOf​(Graph<Integer,​Integer> g)
        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 and 0,1,2,...,edgesNum-1 respectively.

        Specified by:
        newBuilderCopyOf in interface GraphFactory<Integer,​Integer>
        Specified by:
        newBuilderCopyOf in interface IntGraphFactory
        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 not 0,1,2,...,verticesNum-1 or if the edges are not 0,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 and 0,1,2,...,edgesNum-1 respectively.

        Specified by:
        newBuilderCopyOf in interface GraphFactory<Integer,​Integer>
        Specified by:
        newBuilderCopyOf in interface IntGraphFactory
        Parameters:
        g - a graph
        copyVerticesWeights - if true, the weights of the vertices will be copied from the graph to the builder
        copyEdgesWeights - if true, 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 not 0,1,2,...,verticesNum-1 or if the edges are not 0,1,2,...,edgesNum-1

      • setDirected

        IndexGraphFactory setDirected​(boolean directed)
        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() or GraphFactory.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 interface GraphFactory<Integer,​Integer>
        Specified by:
        setDirected in interface IntGraphFactory
        Parameters:
        directed - if true graphs built by this factory will be directed, else they will be undirected
        Returns:
        this factory

      • allowSelfEdges

        IndexGraphFactory allowSelfEdges​(boolean selfEdges)
        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 interface GraphFactory<Integer,​Integer>
        Specified by:
        allowSelfEdges in interface IntGraphFactory
        Parameters:
        selfEdges - if true graphs built by this factory will support self edges, else they will not
        Returns:
        this factory

      • allowParallelEdges

        default IndexGraphFactory 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 interface GraphFactory<Integer,​Integer>
        Specified by:
        allowParallelEdges in interface IntGraphFactory
        Returns:
        this factory

      • allowParallelEdges

        IndexGraphFactory allowParallelEdges​(boolean parallelEdges)
        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 interface GraphFactory<Integer,​Integer>
        Specified by:
        allowParallelEdges in interface IntGraphFactory
        Parameters:
        parallelEdges - if true graphs built by this factory will support parallel edges, else they will not
        Returns:
        this factory

      • undirected

        static IndexGraphFactory undirected()
        Create an undirected index graph factory.
        Returns:
        a new factory that can build undirected index graphs

      • directed

        static IndexGraphFactory directed()
        Create a directed index graph factory.
        Returns:
        a new factory that can build directed index graphs

      • newInstance

        static IndexGraphFactory newInstance​(boolean directed)
        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

        default IndexGraphFactory setOption​(String key,
                                    Object value)
        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 interface GraphFactory<Integer,​Integer>
        Specified by:
        setOption in interface IntGraphFactory
        Parameters:
        key - the option key
        value - the option value
        Returns:
        this builder