package edu.cmu.cs211.graph;

import java.util.Collection;
import java.util.Set;

/**
 * A base to help implement a directed graph
 */
public class GeneralGraph<V,E extends Edge<V>> implements Graph<V,E> {


	/**
	 * Creates an empty graph.
	 */
	public GeneralGraph()
	{
	}
	
	/**
	 * Creates a graph with pre-defined vertices.
	 * 
	 * @param vertices
	 *            A list of the vertices in the graph.
	 * @throws NullPointerException
	 *             If vertices is null, or contains null items
	 */
	public GeneralGraph (Collection<? extends V> vertices)
	{
	}
	
	/**
	 * Creates a graph with pre-defined edges and vertices.
	 * 
	 * @param vertices
	 *            A list of the vertices in the graph.
	 * @param edges
	 * 			  A list of edges for the graph.
	 * @throws IllegalArgumentException if edges contains invalid edges.
	 * @throws NullPointerException
	 *             If vertices or edges is null, or either contain null items
	 */
	public GeneralGraph (Collection<? extends V> vertices, Collection<? extends E> edges)
	{
	}
	
	/**
	 * Copy Constructor
	 * 
	 * @param g
	 *            A graph to copy
	 * @throws IllegalArgumentException if g violates Graph invariants by
	 *            returning illegal edges in its outgoingEdge methods
	 * @throws NullPointerException
	 *             If g is null, or g's methods violates Graph invariants
	 *             by returning null items in verticies or outgoingEdges
	 */
	public GeneralGraph (Graph <V, E> g)
	{
	}
	
	
	public boolean addVertex(V vertex)
	{

	}
	
	public boolean addVertices(Collection<? extends V> vertices)
	{

	}
	
	public boolean addEdge (E e)
	{

	}
	
	public boolean addEdges (Collection<? extends E> edges)
	{

	}

	public boolean removeEdge (V src, V dest)
	{

	}

	public void clearEdges ()
	{

	}

    public Set<V> vertices ()
	{

    }
    
	public E connected (V i, V j)
	{

	}
	
	public Set<V> neighbors (V vertex)
	{

	}
	
	public Collection<E> outgoingEdges (V vertex)
	{
	}
}