import java.util.Collection;

/**
 * Interface specifying a weighted directed graph with int weights.
 * Assumes that we do not have negative cost edges in the graph.
 */
public interface Graph {
  
  /** 
   * Return a collection containing the vertices of this graph
   * @return the vertices as a collection (which is anything iterable)
   */
  public Collection<Vertex> vertices();

  /** 
   * Return a collection containing the edges of this graph
   * @return the edges as a collection (which is anything iterable)
   */
  public Collection<Edge> edges();
 
  /**
   * Return a collection of vertices adjacent to a given vertex v.
   *   i.e., the set of all vertices w where edges v -> w exist in the graph.
   * Return an empty collection if there are no adjacent vertices.
   * @param v one of the vertices in the graph
   * @return an iterable collection of vertices adjacent to v in the graph
   * @throws IllegalArgumentException if v does not exist.
   */
  public Collection<Vertex> adjacentVertices(Vertex v);
  
  /**
   * Test whether vertex b is adjacent to vertex a (i.e. a -> b) in a directed graph.
   * Assumes that we do not have negative cost edges in the graph.
   * @param a one vertex
   * @param b another vertex
   * @return cost of edge if there is a directed edge from a to b in the graph 
   * Return -1 otherwise.
   * @throws IllegalArgumentException if a or b do not exist.
   */
  public int edgeCost(Vertex a, Vertex b);
}