資源簡(jiǎn)介
使用JAVA進(jìn)行編寫的圖與景區(qū)信息管理系統(tǒng),總共5個(gè)功能。創(chuàng)建圖、查詢相應(yīng)頂點(diǎn)信息、從起始點(diǎn)不重復(fù)遍歷全部路徑、從起點(diǎn)到終點(diǎn)最短路徑、鋪設(shè)電網(wǎng)。

代碼片段和文件信息
package?GraphJPro;
public?interface?GraphH?{
// public?void?Init(int?num);//初始化圖結(jié)構(gòu)
public?boolean?InsertVex(SVex?sVex);//將頂點(diǎn)添加到頂點(diǎn)數(shù)組中
public?boolean?InsertEdge(SEdge?sEdge);//將邊保存在鄰接矩陣中
public?SVex?GetVex(int?nVex);//查詢指定頂點(diǎn)信息
// public?int?FindEdge(int?nVexSEdge[]?aEdge);//查詢與指定頂點(diǎn)相連的邊
public?int?FindEdge(int?nVex);//查詢與指定頂點(diǎn)相連的邊
public?int?GetVexnum();//獲取當(dāng)前頂點(diǎn)數(shù)
public?void?CreatGraph(int?n);//創(chuàng)建圖
//public?void?ReadTxt(String?filePath);
??//??public?void?readFileByLines(String?fileName);
public?void?DFS(int?vint?indexPathNode?pList);
public?void?DFSTraverse(int?nVexPathNode?pList);//得到深度優(yōu)先遍歷的結(jié)果
public?void?Init(int?x);
public?void?DijKstra(int?xint?y)?;
public?void?Relax(int?u);
public?int?PickMinInUnvisited(int?x);
public?int?getIndex();
// public?int?getClose(int?nVex)?;
}
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????文件????????912??2018-05-26?19:33??GraphJPro\GraphH.java
?????文件??????10631??2018-05-26?20:37??GraphJPro\GraphJ.java
?????文件???????5347??2018-05-26?20:30??GraphJPro\Main.java
?????文件????????339??2018-05-19?22:46??GraphJPro\PathNode.java
?????文件????????437??2018-05-11?22:30??GraphJPro\Readline.java
?????文件????????567??2018-05-11?15:27??GraphJPro\SEdge.java
?????文件????????574??2018-05-11?15:35??GraphJPro\SGraph.java
?????文件????????819??2018-05-18?16:11??GraphJPro\SVex.java
?????文件????????102??2018-05-11?19:36??GraphJPro\test.txt
?????文件????????142??2018-05-18?13:46??GraphJPro\test1.txt
?????文件????????279??2018-05-26?19:33??GraphJPro\TourismH.java
?????文件???????1520??2018-05-26?20:15??GraphJPro\TourismJ.java
?????文件????????199??2018-05-26?20:37??GraphJPro\View.txt
?????文件????????153??2018-05-20?21:19??GraphJPro\結(jié)果.txt
?????目錄??????????0??2018-05-26?17:49??GraphJPro
-----------?---------??----------?-----??----
????????????????22021????????????????????15
評(píng)論
共有 條評(píng)論