Java EdgeWeightedCycleFinder Examples

Example #1

File: ShortestPath.java Project: yanjinbin/Algorithm4

	private boolean findNegativeCycle(){
		int V =  edgeTo.length;
		EdgeWeightedDigraph spt;
		spt = new EdgeWeightedDigraph(V);
		for (int v = 0 ; v < V ; v++ ) {
			if(edgeTo[v] !=null) 
				spt.addEdge(edgeTo[v]);
		}
		EdgeWeightedCycleFinder cf ; 
		cf = new EdgeWeightedCycleFinder(spt);
		cycle = cf.cycle();
	}

Example #2

File: ShortestPath.java Project: yanjinbin/Algorithm4

	private void findNegativeCycle(){
		int V = edgeTo.length;
		EdgeWeightedDigraph spt ; 
		spt = new EdgeWeightedDigraph;
		for (int v = 0 ; v < V ; v++ ) {
			if(edgeTo[v] !=null ){
				spt.addEdge(edgeTo[v]);
			}
		}
		EdgeWeightedCycleFinder cf;
		cf = new EdgeWeightedCycleFinder(spt);
		cycle = cf.cycle();//cycle()方法来自4.2界
	}