Starting Connectors method
	public void connectors(ArrayList<Node<Integer>> vertices){
		/*
		 * Complete this method
		 */

			visited.add(0);
		}
		int[] dfsnum = new int[numPeople];
		int[] back = new int[numPeople];
		for(int c = 0; c < numPeople; c++){
			dfsnum[c]=0;
			back[c]=0;
		}
		int visitable = numPeople;
		ArrayList<String> results = new ArrayList<String>();
		Node<Node<Integer>> searchStack = new Node<Node<Integer>>(null, null);
		while(visitable>0){
			if(searchStack.data==null){
				searchStack.data=vertices.get(visited.indexOf(0));
				continue;
			}
			if(searchStack)
			visitable--;
			int visits = 0;
			int startConnections=0;
			Node<Integer> current = vertices.get();
		}
		for (int i=results.size()-1; i > 0; i--){
			System.out.print(results.get(i) + ",");
		}
		if (results.size()>0){
			System.out.print(results.get(0));
		}
		else{
			System.out.print("No connectors exist");
		}
		return;
What I

I have an understanding of how I want to do it.  I need to code what
I've conceptualized, then figure out how to determine whether your
starting point is a connector or not.