Module org.jgrapht.unimi.dsi
Package org.jgrapht.sux4j

Class SuccinctIntUndirectedGraph

  • All Implemented Interfaces:
    java.io.Serializable, Graph<java.lang.Integer,​java.lang.Integer>
    public class SuccinctIntUndirectedGraph
extends AbstractSuccinctUndirectedGraph<java.lang.Integer>
implements java.io.Serializable
    An immutable undirected graph with Integer edges represented using quasi-succinct data structures.

    The graph representation of this implementation is similar to that of SparseIntDirectedGraph: nodes and edges are initial intervals of the natural numbers. Under the hood, however, this class uses the Elias–Fano representation of monotone sequences to represent the positions of ones in the (linearized) adjacency matrix of the graph. Instances are serializable and thread safe.

    If the vertex set is compact (i.e., vertices are numbered from 0 consecutively), space usage will be close to the information-theoretical lower bound (typically, a few times smaller than a SparseIntUndirectedGraph).

    Enumeration of edges is very slow. Adjacency tests are very fast and happen in almost constant time.

    SuccinctUndirectedGraph is a much faster implementation with a similar footprint using IntIntSortedPair as edge type. Please read the class documentation for more information.

    See Also:
    SuccinctUndirectedGraph, Serialized Form

    • Field Detail

      • cumulativeOutdegrees

        private final it.unimi.dsi.sux4j.util.EliasFanoIndexedMonotoneLongBigList cumulativeOutdegrees
        The cumulative list of outdegrees (number of edges in sorted order, including loops).

      • cumulativeIndegrees

        private final it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList cumulativeIndegrees
        The cumulative list of indegrees (number of edges in reversed order, including loops).

      • successors

        private final it.unimi.dsi.sux4j.util.EliasFanoIndexedMonotoneLongBigList successors
        The cumulative list of successor (edges in sorted order, including loops) lists.

      • predecessors

        private final it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList predecessors
        The cumulative list of predecessor (edges in reversed order, including loops) lists.

    • Constructor Detail

      • SuccinctIntUndirectedGraph

        public SuccinctIntUndirectedGraph​(Graph<java.lang.Integer,​E> graph)
        Creates a new immutable succinct undirected graph from a given undirected graph.
        Type Parameters:
        E - the graph edge type
        Parameters:
        graph - an undirected graph: for good results, vertices should be numbered consecutively starting from 0.

      • SuccinctIntUndirectedGraph

        public SuccinctIntUndirectedGraph​(int numVertices,
                                  java.util.List<Pair<java.lang.Integer,​java.lang.Integer>> edges)
        Creates a new immutable succinct undirected graph from an edge list.

        This constructor just builds a SparseIntUndirectedGraph and delegates to the main constructor.

        Parameters:
        numVertices - the number of vertices.
        edges - the edge list.
        See Also:
        SuccinctIntUndirectedGraph(Graph)

    • Method Detail

      • containsEdge

        public boolean containsEdge​(java.lang.Integer e)
        Description copied from interface: Graph
        Returns true if this graph contains the specified edge. More formally, returns true if and only if this graph contains an edge e2 such that e.equals(e2). If the specified edge is null returns false.
        Specified by:
        containsEdge in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        e - edge whose presence in this graph is to be tested.
        Returns:
        true if this graph contains the specified edge.

      • edgeSet

        public java.util.Set<java.lang.Integer> edgeSet()
        Description copied from interface: Graph
        Returns a set of the edges contained in this graph. The set is backed by the graph, so changes to the graph are reflected in the set. If the graph is modified while an iteration over the set is in progress, the results of the iteration are undefined.

        The graph implementation may maintain a particular set ordering (e.g. via LinkedHashSet) for deterministic iteration, but this is not required. It is the responsibility of callers who rely on this behavior to only use graph implementations which support it.

        Specified by:
        edgeSet in interface Graph<java.lang.Integer,​java.lang.Integer>
        Returns:
        a set of the edges contained in this graph.

      • degreeOf

        public int degreeOf​(java.lang.Integer vertex)
        Description copied from interface: Graph
        Returns the degree of the specified vertex.

        A degree of a vertex in an undirected graph is the number of edges touching that vertex. Edges with same source and target vertices (self-loops) are counted twice.

        In directed graphs this method returns the sum of the "in degree" and the "out degree".

        Specified by:
        degreeOf in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        vertex - vertex whose degree is to be calculated.
        Returns:
        the degree of the specified vertex.

      • edgesOf

        public it.unimi.dsi.fastutil.ints.IntSet edgesOf​(java.lang.Integer vertex)
        Description copied from interface: Graph
        Returns a set of all edges touching the specified vertex. If no edges are touching the specified vertex returns an empty set.
        Specified by:
        edgesOf in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        vertex - the vertex for which a set of touching edges is to be returned.
        Returns:
        a set of all edges touching the specified vertex.

      • incomingEdgesOf

        public it.unimi.dsi.fastutil.ints.IntSet incomingEdgesOf​(java.lang.Integer vertex)
        Description copied from interface: Graph
        Returns a set of all edges incoming into the specified vertex.

        In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.

        Specified by:
        incomingEdgesOf in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        vertex - the vertex for which the list of incoming edges to be returned.
        Returns:
        a set of all edges incoming into the specified vertex.

      • outgoingEdgesOf

        public it.unimi.dsi.fastutil.ints.IntSet outgoingEdgesOf​(java.lang.Integer vertex)
        Description copied from interface: Graph
        Returns a set of all edges outgoing from the specified vertex.

        In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.

        Specified by:
        outgoingEdgesOf in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        vertex - the vertex for which the list of outgoing edges to be returned.
        Returns:
        a set of all edges outgoing from the specified vertex.

      • getEdgeSource

        public java.lang.Integer getEdgeSource​(java.lang.Integer e)
        Description copied from interface: Graph
        Returns the source vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).
        Specified by:
        getEdgeSource in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        e - edge of interest
        Returns:
        source vertex

      • getEdgeTarget

        public java.lang.Integer getEdgeTarget​(java.lang.Integer e)
        Description copied from interface: Graph
        Returns the target vertex of an edge. For an undirected graph, source and target are distinguishable designations (but without any mathematical meaning).
        Specified by:
        getEdgeTarget in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        e - edge of interest
        Returns:
        target vertex

      • getEdge

        public java.lang.Integer getEdge​(java.lang.Integer sourceVertex,
                                 java.lang.Integer targetVertex)
        Description copied from interface: Graph
        Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph. Otherwise returns null. If any of the specified vertices is null returns null

        In undirected graphs, the returned edge may have its source and target vertices in the opposite order.

        Specified by:
        getEdge in interface Graph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        sourceVertex - source vertex of the edge.
        targetVertex - target vertex of the edge.
        Returns:
        an edge connecting source vertex to target vertex.

      • containsEdge

        public boolean containsEdge​(java.lang.Integer sourceVertex,
                            java.lang.Integer targetVertex)
        Description copied from interface: Graph
        Returns true if and only if this graph contains an edge going from the source vertex to the target vertex. In undirected graphs the same result is obtained when source and target are inverted. If any of the specified vertices does not exist in the graph, or if is null, returns false.
        Specified by:
        containsEdge in interface Graph<java.lang.Integer,​java.lang.Integer>
        Overrides:
        containsEdge in class AbstractGraph<java.lang.Integer,​java.lang.Integer>
        Parameters:
        sourceVertex - source vertex of the edge.
        targetVertex - target vertex of the edge.
        Returns:
        true if this graph contains the specified edge.
        See Also:
        Graph.containsEdge(Object, Object)

      • assertEdgeExist

        protected boolean assertEdgeExist​(java.lang.Integer e)
        Ensures that the specified edge exists in this graph, or else throws exception.
        Parameters:
        e - edge
        Returns:
        true if this assertion holds.
        Throws:
        java.lang.IllegalArgumentException - if specified edge does not exist in this graph.

      • iterables

        public GraphIterables<java.lang.Integer,​java.lang.Integer> iterables()
        Description copied from interface: Graph
        Access the graph using the GraphIterables interface. This allows accessing graphs without the restrictions imposed by 32-bit arithmetic. Moreover, graph implementations are free to implement this interface without explicitly materializing intermediate results.
        Specified by:
        iterables in interface Graph<java.lang.Integer,​java.lang.Integer>
        Returns:
        the graph iterables