java 圖的深度優(yōu)先和廣度優(yōu)先搜索以及關(guān)鍵路徑

1、package數(shù)據(jù)結(jié)構(gòu).圖的鄰接表法思路(這是一個(gè)無向圖)：1、從命令行接收增加節(jié)點(diǎn)數(shù)把它放在一個(gè)一維數(shù)組中2、增加邊數(shù)，同時(shí)找這個(gè)邊是否在圖中，若在，就構(gòu)造鄰接表imptjava.util.ArrayListimptjava.util.Scannerimptjava.util.StackclassArcNode表結(jié)點(diǎn)intinfo該弧相關(guān)信息的指針intadjvex鄰接點(diǎn)域ArcNodenext指向下一條弧的指針publicArcNo

2、de(intadjvexintinfo)構(gòu)造函數(shù)this.adjvex=adjvexthis.info=infothis.next=nullclassVNode頭結(jié)點(diǎn)intdata頂點(diǎn)信息（如數(shù)據(jù)等）ArcNodefirstarc指向第一條依附該頂點(diǎn)的邊的弧指針publicVNode(intdata)構(gòu)造函數(shù)this.data=datathis.firstarc=nullclassALGraphArrayListvertces=newA

3、rrayList()存放圖頂點(diǎn)信息的數(shù)組intvexnum圖的當(dāng)前頂點(diǎn)數(shù)intarcnum圖的弧數(shù)publicALGraph()構(gòu)造函數(shù)this.arcnum=0this.vexnum=0v1=scanner.nextInt()v2=scanner.nextInt()length=scanner.nextInt()inti=LocateVex(v1)查找ij的位置intj=LocateVex(v2)intnum=(Integer)ind

4、egree.get(j)1indegree.set(jnum)入度加1this.indegreeCritical.set(jnum)s=newArcNode(jlength)將j的位置添加進(jìn)鄰接表if(g.vertces.get(i).firstarc==null)g.vertces.get(i).firstarc=selsef(temp=g.vertces.get(i).firstarctemp.next!=nulltemp=temp

5、.next)temp.next=sp=newArcNode(i)將i的位置添加進(jìn)鄰接表if(g.vertces.get(j).firstarc==null)g.vertces.get(j).firstarc=pelsef(temp1=g.vertces.get(j).firstarctemp1.next!=nulltemp1=temp1.next)temp1.next=pprivateintLocateVex(intv2)若g中存在項(xiàng)點(diǎn)