Package org.simplegraph.impl

Class DirectedSparseGraph<V>

java.lang.Object
org.simplegraph.impl.DirectedSparseGraph<V>
All Implemented Interfaces:
DirectedGraph<V>, Graph<V>
public class DirectedSparseGraph<V> extends Object implements DirectedGraph<V>
Sparse graph implementation for directed graphs.

  • Field Details

  • Constructor Details

    • DirectedSparseGraph

      public DirectedSparseGraph()
      Default constructor

    • DirectedSparseGraph

      public DirectedSparseGraph(int size)
      Create a graph with a starting size.
      Parameters:
      size - starting size

    • DirectedSparseGraph

      public DirectedSparseGraph(DirectedSparseGraph<V> graph)

  • Method Details

    • addEdge

      public boolean addEdge(V v1, V v2)
      Description copied from interface: Graph
      Add an edge between two vertices. Add the two vertices in the graph if they don't exists
      Specified by:
      addEdge in interface Graph<V>
      Parameters:
      v1 - first vertex
      v2 - second vertex
      Returns:
      true if the graph has been modified

    • addVertex

      public boolean addVertex(V vertex)
      Add a vertex to the graph.
      Parameters:
      vertex - the vertex to add
      Returns:
      true if the the graph has been modified

    • containsVertex

      public boolean containsVertex(V vertex)
      Check the existence of a vertex in the graph.
      Parameters:
      vertex - the vertex to check
      Returns:
      true if the graph contains vertex

    • countVertices

      public int countVertices()
      Get the number of vertices in the graph.
      Returns:
      number of vertices

    • existsPath

      public boolean existsPath(V source, V destination)
      Does a path exists between source and destination.
      Parameters:
      source - source vertex
      destination - destination vertex
      Returns:
      true if a path exists

    • existsEdge

      public boolean existsEdge(V v1, V v2)
      Check the existence of an edge that goes from the first vertex to the second.
      Parameters:
      v1 - first vertex
      v2 - second vertex
      Returns:
      true if an edge from v1 to v2 exists

    • countNeighbors

      public int countNeighbors(V vertex)
      Get the number of neighbors for a vertex.
      Parameters:
      vertex - the spefied vertex
      Returns:
      number of neighbors, -1 if vertex does not exists

    • getPath

      public List<V> getPath(V source, V destination)
      Get a path between a source and a destination
      Parameters:
      source - source vertex
      destination - destination vertex
      Returns:
      a list containing the vertices that compose the path, in order; an empty LinkedList if there is no path, null if the source and the destination are equals or are not contained in the graph

    • removeEdge

      public boolean removeEdge(V v1, V v2)
      Remove an edge that goes from the first vertex to the second.
      Parameters:
      v1 - first vertex
      v2 - second vertex
      Returns:
      true if the graph has been changed

    • removeVertex

      public boolean removeVertex(V vertex)
      Remove a vertex from the graph
      Parameters:
      vertex - the vertex to remove
      Returns:
      true if the graph has been modified

    • getVertices

      public List<V> getVertices()
      Get all the vertices in the graph
      Returns:
      a list containing all the graph vertices

    • getNeighbors

      public List<V> getNeighbors(V vertex)
      Get the neighbors of a vertex, both incident and outer vertices.
      Parameters:
      vertex - the specified vertex
      Returns:
      the list of vertices that are neighbors of vertex null if the vertex is not contained in the graph

    • getInVertices

      public List<V> getInVertices(V vertex)
      Get the incident vertices of a vertex.
      Specified by:
      getInVertices in interface DirectedGraph<V>
      Parameters:
      vertex - the specified vertex
      Returns:
      a list containing the incident vertices of vertex, null if vertex is not contained in the graph

    • getOutVertices

      public List<V> getOutVertices(V vertex)
      Get the outer vertices of a vertex.
      Specified by:
      getOutVertices in interface DirectedGraph<V>
      Parameters:
      vertex - the specified vertex
      Returns:
      a list containing the outer vertices of vertex, null if vertex is not contained in the graph

    • getInDegree

      public int getInDegree(V vertex)
      Get the number of incident vertices of a vertex.
      Specified by:
      getInDegree in interface DirectedGraph<V>
      Parameters:
      vertex - the specified vertex
      Returns:
      the number of incident vertices of vertex, -1 if vertex is not contained in the graph

    • getOutDegree

      public int getOutDegree(V vertex)
      Get the number of outer vertices of a vertex.
      Specified by:
      getOutDegree in interface DirectedGraph<V>
      Parameters:
      vertex - the specified vertex
      Returns:
      the number of outer vertices of vertex, -1 if vertex is not contained in the graph

    • getSpanningTree

      public DirectedGraph<V> getSpanningTree()
      Specified by:
      getSpanningTree in interface Graph<V>

    • countEdges

      public int countEdges()
      Get the number of edges in the graph.
      Returns:
      number of edges

    • copy

      public void copy(org.simplegraph.impl.BaseSparseGraph<V,Boolean> graph)

    • addSingleEdge

      protected boolean addSingleEdge(V v1, V v2, Boolean edge)

    • getSingleEdge

      protected Boolean getSingleEdge(V v1, V v2)

    • _removeEdge

      protected boolean _removeEdge(V v1, V v2)

    • _countEdges

      protected int _countEdges()