/* uGraph: the undirected graph interface.
 *
 * uGraph uG = new uGraphLists(Buffer);
 *
 * The use of this interface allows the algorithms class to deal with all forms of the
 * graph implementations. E.g. Girth(Graph g) will take in any graph and return the girth.
 */


package graphADT;

public interface uGraph extends Graph
{
    void addArc(int i, int j);		// has to be overridden to ensure the graph is UNDIRECTED

    void removeArc(int i, int j);	// has to be overridden to ensure the graph is UNDIRECTED

    int size(); 		// Number of edges. But since its undirected this is halved.
}