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

Class SuccinctUndirectedGraph.SuccinctGraphIterables

java.lang.Object
org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
All Implemented Interfaces:
Serializable, GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
Enclosing class:
SuccinctUndirectedGraph
private static final class SuccinctUndirectedGraph.SuccinctGraphIterables extends Object implements GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>, Serializable

  • Field Details

  • Constructor Details

    • SuccinctGraphIterables

      private SuccinctGraphIterables()

    • SuccinctGraphIterables

      private SuccinctGraphIterables(SuccinctUndirectedGraph graph)

  • Method Details

    • getGraph

      public Graph<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair> getGraph()
      Description copied from interface: GraphIterables
      Get the underlying graph.
      Specified by:
      getGraph in interface GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Returns:
      the underlying graph

    • vertexCount

      public long vertexCount()
      Description copied from interface: GraphIterables
      Return the number of vertices in the graph.
      Specified by:
      vertexCount in interface GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Returns:
      the number of vertices

    • edgeCount

      public long edgeCount()
      Description copied from interface: GraphIterables
      Return the number of edges in the graph.
      Specified by:
      edgeCount in interface GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Returns:
      the number of edges.

    • edges

      public Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> edges()
      Description copied from interface: GraphIterables
      Returns an iterable over the edges of the graph.

      Whether the ordering is deterministic, depends on the actual graph implementation. It is the responsibility of callers who rely on this behavior to only use graph implementations which support it.

      Specified by:
      edges in interface GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Returns:
      an iterable over the edges of the graph.

    • edgesOf

      public Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> edgesOf(Integer source)
      Description copied from interface: GraphIterables
      Returns an iterable view over all edges touching the specified vertex. The returned iterators are live views. If the graph is modified while an iteration is in progress, the results of the iteration are undefined. If no edges are touching the specified vertex, the returned iterators are already exhausted.
      Specified by:
      edgesOf in interface GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Parameters:
      source - input vertex
      Returns:
      an iterable view of the vertices contained in this graph

    • sortedEdges

      private Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> sortedEdges(int source)

    • reverseSortedEdgesOfNoLoops

      private Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> reverseSortedEdgesOfNoLoops(int target)

    • incomingEdgesOf

      public Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> incomingEdgesOf(Integer vertex)
      Description copied from interface: GraphIterables
      Returns an iterable view over all edges incoming into the specified vertex. The returned iterators are live views. If the graph is modified while an iteration is in progress, the results of the iteration are undefined.

      In the case of undirected graphs the returned iterators return 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 GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Parameters:
      vertex - input vertex
      Returns:
      an iterable view of all edges incoming into the specified vertex

    • outgoingEdgesOf

      public Iterable<it.unimi.dsi.fastutil.ints.IntIntSortedPair> outgoingEdgesOf(Integer vertex)
      Description copied from interface: GraphIterables
      Returns an iterable view over all edges outgoing into the specified vertex. The returned iterators are live views. If the graph is modified while an iteration is in progress, the results of the iteration are undefined.

      In the case of undirected graphs the returned iterators return 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 GraphIterables<Integer,it.unimi.dsi.fastutil.ints.IntIntSortedPair>
      Parameters:
      vertex - input vertex
      Returns:
      an iterable view of all edges outgoing from the specified vertex