Package graph

Interface DirectedGraph<V,E>

Type Parameters:
V - the type of vertices
E - the type of edges
All Known Subinterfaces:
WeightedDigraph<V,E>
All Known Implementing Classes:
Maze
public interface DirectedGraph<V,E>
This is a constraint interface for a directed graph of type G, with vertices of type V and edges of type E. For use in implementing generic graph algorithms.

  • Method Summary

    Modifier and Type
    Method
    Description
    V
    dest(E edge)
    The destination vertex for an edge in the graph.
    Iterable<E>
    outgoingEdges(V vertex)
    All outgoing edges from a vertex in the graph
    V
    source(E edge)
    The source vertex for an edge in the graph.

  • Method Details

    • outgoingEdges

      Iterable<E> outgoingEdges(V vertex)
      All outgoing edges from a vertex in the graph

    • source

      V source(E edge)
      The source vertex for an edge in the graph.

    • dest

      V dest(E edge)
      The destination vertex for an edge in the graph.