import java.util.*;


/**
 * Searches a Graph using Bellman-Ford. This implementation
 * can handle a graph with negative edge weights
 *
 */
public class BellmanFord {

	/**
	 *
	 * @param <V> The type for the vertices in the graph.
	 * @param <E> The type for edges in the graph.
	 * @param g The graph in which to search
	 * @param start The starting vertex.
	 * @param finish The ending vertex.
	 * @return The list of edges in the path, or null if there is no path.
	 * @throws IllegalArgumentException if g has a negative cost cycle
	 */
	public <V,E extends Edge<V>> List<E> shortestPath(GraphInterface<V,E> g, V src, V dest) {
		return null;
	}

}