Interface Explorable<V,E>

Type Parameters:
V - the vertex type
E - the edge type
All Known Subinterfaces:
Graph<V,E>
All Known Implementing Classes:
HashGraph
public interface Explorable<V,E>
An explorable graph-like structure. The explorable interface defines the minimum operations used to enable the exploration of a graph, whether in-memory or dynamically-generated.
Author:
Lee A. Christie

  • Method Summary

    Modifier and Type
    Method
    Description
    E
    edge(V from, V to)
    returns the edge between the specified pair of vertices.
    Set<V>
    neighbours(V vertex)
    The vertices for which there is an out-edge from the specified vertex to that vertex.

  • Method Details

    • neighbours

      Set<V> neighbours(V vertex)
      The vertices for which there is an out-edge from the specified vertex to that vertex.
      Parameters:
      vertex - the specified vertex, not null
      Returns:
      the set of neighbours

    • edge

      E edge(V from, V to)
      returns the edge between the specified pair of vertices.
      Parameters:
      from - the vertex for which this will be an out-edge, not null
      to - the vertex for which this will be an in-edge, not null
      Returns:
      the edge
      Throws:
      NoSuchElementException - if the edge does not exist between from and to