public static void main(String[] args)
	{
		Graph G = null;
		try
		{
			G = new Graph(new In(args[0]));
		}
		catch (Exception e)
		{
			System.out.println(e);
			System.exit(1);
		}

		int s = Integer.parseInt(args[1]);
		ISearch search = new Search(G, s);

		for (int v = 0; v < G.V(); v++)
			if (search.marked(v))
				System.out.print(v + " ");
		System.out.println();

		if (search.adjCount() != G.V())
			System.out.print("NOT ");
		System.out.println("Connected");
	}