java实现邻接矩阵，DFS深搜，并求从顶点u到v的简单路径

 完整的代码，拿走。

public class AMGraph {
	private static int MVNum=100;
	private int vexnum;//当前点数
	private int arcnum;//当前边数
	private char[] vexs;//顶点表
	private int[][] arcs;//邻接矩阵
	
	public AMGraph(int vexnum,int arcnum) {
		this.vexnum = vexnum;
		this.arcnum=arcnum;
		this.vexs = new char[vexnum];
		this.arcs = new int[vexnum][vexnum];
	}
	 
	public static int getMVNum() {
		return MVNum;
	}

	public static void setMVNum(int mVNum) {
		MVNum = mVNum;
	}

	public int getVexnum() {
		return vexnum;
	}
	public void setVexnum(int vexnum) {
		this.vexnum = vexnum;
	}
	public int getArcnum() {
		return arcnum;
	}
	public void setArcnum(int arcnum) {
		this.arcnum = arcnum;
	}
	public char[] getVexs() {
		return vexs;
	}
	public void setVexs(char[] vexs) {
		this.vexs = vexs;
	}
	public int[][] getArcs() {
		return arcs;
	}
	public void setArcs(int[][] arcs) {
		this.arcs = arcs;
	}
	

}

 

import java.io.IOException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;

public class text_7 {
//	private boolean visited[]={false};//简单路径是否被访问过。
	private boolean[] visited=new boolean[100];//简单路径是否被访问过。
	private Queue<Character> queue = new LinkedList();
	private Stack<Character> stack=new Stack<>();
	private char[] push=new char[100];
	private int rear=0;
	private Scanner scanner=new Scanner(System.in);
	public int LocateV(ALGraph alGraph,char v){
		int flag=0,i=0;
		for(i=0;i<alGraph.getVexnum();i++){
			if(alGraph.getVertices()[i].getData()==v){
				flag=1;
				break;
			}
		}
		if(flag==1)
			return i;
		else
			return 000;
		
	}
	public int LocateVex(AMGraph amGraph,char v){
		int flag=0,i=0;
		for(i=0;i<amGraph.getVexnum();i++){
			if(amGraph.getVexs()[i]==v){
				flag=1;
				break;
			}
		}
		if(flag==1)
			return i;
		else
			return 000;
		
	}
	public void CreateUDN(AMGraph amGraph) throws IOException{
		System.out.println("输入各顶点信息:");
		for(int i=0;i<amGraph.getVexnum();i++){
			char c = scanner.next().charAt(0);
			amGraph.getVexs()[i]=c;
		}
		
		//初始化邻接矩阵，边的权值设置为极大值Mvmax;
		for(int i=0;i<amGraph.getVexnum();i++){
			for(int j=0;j<amGraph.getVexnum();j++){
				amGraph.getArcs()[i][j]=0;
			}
		}
		//构造邻接矩阵
		
		for(int k=0;k<amGraph.getArcnum();++k){
			System.out.println("输入一条边依附的顶点");
			char v1 = scanner.next().charAt(0); 
			char v2 = scanner.next().charAt(0); 
//			int w=scanner.nextInt();
			int i=LocateVex(amGraph, v1);
			int j=LocateVex(amGraph, v2);
			amGraph.getArcs()[i][j]=1;
			amGraph.getArcs()[j][i]=amGraph.getArcs()[i][j];
		}
		
	}
	public void CreateUDG(ALGraph alGraph){
		System.out.println("输入各顶点信息:");
		//输入各顶点，构造表头结点表
		for(int i=0;i<alGraph.getVexnum();i++){
			char c = scanner.next().charAt(0);
			alGraph.getVertices()[i].data=c;
			alGraph.getVertices()[i].setFirstarc(null);
		}
		//构造邻接表;
		for(int k=0;k<alGraph.getArcnum();k++){
			System.out.println("输入一条边依附的顶点");
			char v1 = scanner.next().charAt(0); 
			char v2 = scanner.next().charAt(0);
			int i=LocateV(alGraph, v1);//0
			int j=LocateV(alGraph, v2);//1
			ArcNode p1=new ArcNode();
			p1.setAdjvex(j);//边中指向的顶点位置。
			p1.setNextArc(alGraph.getVertices()[i].getFirstarc());
			alGraph.getVertices()[i].setFirstarc(p1);
			ArcNode p2=new ArcNode();
			p2.setAdjvex(i);
			p2.setNextArc(alGraph.getVertices()[j].getFirstarc());
			alGraph.getVertices()[j].setFirstarc(p2);
		}
	}
	
//	public void text1(ALGraph alGraph){
//		for(int i=0;i<alGraph.getVexnum();i++){
//			VexNode p=alGraph.getVertices()[i];
//			System.out.print(p.getData()+" ");
//			while(p!=null){
//				p=p
//			}
//		}
//		
//	}
	public void text(AMGraph amGraph){
		for(int i=0;i<amGraph.getVexnum();i++){
			for(int j=0;j<amGraph.getVexnum();j++){
				System.out.print(amGraph.getArcs()[i][j]+" ");
			}
			System.out.println();
		}
	}
	public void DFS(AMGraph amGraph){
		int w;
		for(int i=0;i<100;i++)
			visited[i]=false;
		System.out.println("输入顶点u,v");
		char u = scanner.next().charAt(0); 
		char v = scanner.next().charAt(0);
		int i=LocateVex(amGraph, u);
		int j=LocateVex(amGraph, v);
		stack.push(u);
		push[rear]=u;
		rear++;
		visited[i]=true;
		while( (!stack.empty()) && (!visited[j]) ){
		      int k = LocateVex(amGraph, stack.peek());//栈顶元素所在位置
		      for(w = 1; w <= amGraph.getVexnum(); w++)
		          if((amGraph.getArcs()[k][w] == 1) && (!visited[w])){//有路且没被访问过
		               visited[w] = true;
		               stack.push(amGraph.getVexs()[w]);//压入栈
		               push[rear] = amGraph.getVexs()[w];//放队列里
		               rear++;
		               break;
		          }
		      if(w == (amGraph.getVexnum()+1)){//没有路弹出
		        stack.pop();
		        rear--;
		      }
		 }
		
	}
	public void output()
	{
	   for(int i = 0; i < rear-1; i++)
		   System.out.print(push[i]+"->");
	   System.out.println(push[rear-1]);
	}
	public void DFSS(AMGraph amGraph,char v){
		int i=LocateVex(amGraph, v);
		stack.push(v);
		visited[i]=true;
		while(!stack.empty()){
			v=stack.pop();
			i=LocateVex(amGraph, v);
			if(!visited[i]){
				stack.push(v);
				visited[i]=true;
				
			}
			
		}
		while( (!stack.empty()) && (!visited[j]) ){
		      int k = LocateVex(amGraph, stack.peek());//栈顶元素所在位置
		      for(w = 1; w <= amGraph.getVexnum(); w++)
		          if((amGraph.getArcs()[k][w] == 1) && (!visited[w])){//有路且没被访问过
		               visited[w] = true;
		               stack.push(amGraph.getVexs()[w]);//压入栈
		               push[rear] = amGraph.getVexs()[w];//放队列里
		               rear++;
		               break;
		          }
		      if(w == (amGraph.getVexnum()+1)){//没有路弹出
		        stack.pop();
		        rear--;
		      }
		 }
	}
	public static void main(String[] args) throws IOException  {
		Scanner scanner=new Scanner(System.in);
		System.out.println("输入总顶点数,总边数;");
		AMGraph amGraph=new AMGraph(scanner.nextInt(),scanner.nextInt());
		text_7 text_7=new text_7();
		text_7.CreateUDN(amGraph);
		text_7.text(amGraph);
		te
//		text_7.DFS(amGraph);
		text_7.output();
//		
		
	}

}