// ²âÊÔ 0 ¸ö×èµ²µã public List<Vertex> test0Stop(MGraph pMGraph) { List<Vertex> vertList; if (pMGraph.isPathCacheValid(0, 4)) { vertList = pMGraph.getShortestPathFromPathCache(0, 4); } else { vertList = pMGraph.getOrCreateShortestPath(0, 4); } return vertList; }
// ²âÊÔ 1 ¸ö×èµ²µã public List<Vertex> test1Stop(MGraph pMGraph) { StopPoint pStopPoint = null; pStopPoint = new StopPoint(); pMGraph.addStopPoint(1, 0, pStopPoint); List<Vertex> vertList; if (pMGraph.isPathCacheValid(0, 8)) { vertList = pMGraph.getShortestPathFromPathCache(0, 8); } else { vertList = pMGraph.getOrCreateShortestPath(0, 8); } return vertList; }