public static void graphDepthFirstTraversal(String[][] edgeList){
    	if(edgeList.length == 0){
    		return;
    	}else{
    		ArrayList<String> discovered = new ArrayList<String>();
    		timeStamp = 0; 
    		for(String[] edge : edgeList){
    			String node1 = edge[0];
    			String node2 = edge[1];
    			if(!discovered.contains(node1)){
    				recursiveDFTraversal(node1, edgeList, discovered);
    			}else if(!discovered.contains(node2)){
    				recursiveDFTraversal(node2, edgeList, discovered);
    			}
    		}
    	}
    }