public class Graph{
public void dfs(Vertex u)
{
u.visit();
u.visited = true;
for(each v such that (u,v) belongs E)
if(!v.visited){
dfs(v);
}
Graph
原文：http://www.cnblogs.com/neweracoding/p/4189649.html
