import java.util.*;

public class Graph {

	private int[][] graph;

	/* This is the only constructor for Graph.
	 * All reading from the file should be done
	 * inside here and not in the main method.
	*/
	public Graph(Scanner fs) {
		//insert your code here
	}

	public void printGraph() {
		//insert your code here
	}

	// Checks if an edge e = (a->b) exists in the graph
	public boolean edgeExists(int a, int b) {
		//insert your code here
	}

	public void printInverse() {
		//insert your code here
	}

	public int[] getSelfLoops() {
		//insert your code here

		//returns an array with integers representing the nodes that
		//are involved in a self loop.
	}

	public int pathExists(int[] nodes) {
		//insert your code here

		//returns the total weight of the path or a special error value otherwise
	}
}