/**
* 利用广度优先搜索进行路径判断 p - q 之间是否有路径
*
* @param p
* @param q
* @return
*/
public static boolean pathCheckBFS(GraphNode<Integer> p, GraphNode<Integer> q) {
boolean isFound = false;
p.restoreVisited();
isFound |= pathOrderCheckBFS(p, q);
q.restoreVisited();
isFound |= pathOrderCheckBFS(q, p);
return isFound;
}
