algo.java

来自「Java实现的常用数据结构算法」· Java 代码 · 共 48 行

package graph;
import java.awt.*;
public class Algo{	
  public static ShowPanel pane;	
  public static void dfr(Graph g,int v,boolean[] marked){
		int[] connections=g.neighbors(v);
		int i;
		int nextNeighbor;
		marked[v]=true;
		Point p=(Point)g.getLabel(v);
		pane.fillPoint(p);
		try{
		new Thread().sleep(1000);
		}catch(InterruptedException e){
		}
		
		for(i=0;i<connections.length;i++){
			nextNeighbor=connections[i];
			if(!marked[nextNeighbor])
			dfr(g,nextNeighbor,marked);
		}
	}
	public static void dfPrint(Graph g,int start){
		boolean[] marked=new boolean[g.size()];
		dfr(g,start,marked);
	}
	public static void wfr(Graph g,int v,boolean[] marked){
		int[] connections=g.neighbors(v);
		int i;
		int nextNeighbor;
		marked[v]=true;
		Point p=(Point)g.getLabel(v);
		pane.fillPoint(p);
		try{
		new Thread().sleep(1000);
		}catch(InterruptedException e){
		}		
		for(i=0;i<connections.length;i++){
			nextNeighbor=connections[i];
			if(!marked[nextNeighbor])
			dfr(g,nextNeighbor,marked);
		}
	}
	public static void wfPrint(Graph g,int start){
		boolean[] marked=new boolean[g.size()];
		wfr(g,start,marked);
	}
}