十字鏈表相對(duì)比鄰接表難一點(diǎn)，相較而言，十字鏈表的結(jié)點(diǎn)比鄰接表多了一個(gè)指針域用來鏈接指向該“頭”結(jié)點(diǎn)的其它結(jié)點(diǎn)。
如何實(shí)現(xiàn)十字鏈表，我們可以從實(shí)現(xiàn)鄰接表找突破口，因?yàn)閷?shí)現(xiàn)鄰接表就確定了各個(gè)結(jié)點(diǎn)的nextOut值，接下來我們只需要確定各個(gè)結(jié)點(diǎn)的nextIn。
1：確定各個(gè)頂點(diǎn)的nextOut：按行遍歷鄰接矩陣，創(chuàng)建以當(dāng)前行結(jié)點(diǎn)為起點(diǎn)的邊結(jié)點(diǎn)對(duì)象并確定nextOut值：

對(duì)應(yīng)代碼：

for (int i = 0; i < numNodes; i++) {headers[i] = new OrthogonalNode(i, -1);tempPreviousNode = headers[i];for (int j = 0; j < numNodes; j++) {if (paraMatrix[i][j] != 0) {// Create a new node.tempNode = new OrthogonalNode(i, j);// LinktempPreviousNode.nextOut = tempNode;tempPreviousNode = tempNode;} // Of if} // Of for j} // Of for i

2：確定每個(gè)頂點(diǎn)的nextIn：遍歷每個(gè)邊結(jié)點(diǎn)，每個(gè)邊結(jié)點(diǎn)的column值說明了該column對(duì)應(yīng)的結(jié)點(diǎn)的nextIn應(yīng)該指向當(dāng)前邊結(jié)點(diǎn)，但需要注意的是，我們只能第一次通過column從header數(shù)組里面找到對(duì)應(yīng)結(jié)點(diǎn)，如果當(dāng)前column結(jié)點(diǎn)的入度大于1，則需要遍歷當(dāng)前結(jié)點(diǎn)nextIn所指向的鏈表，直到遍歷到結(jié)點(diǎn)的nextIn為空時(shí)再賦值（除非我們用頭插法）。為了避免遍歷尋找需要插入nextIn的結(jié)點(diǎn)，可以為每個(gè)頂點(diǎn)設(shè)置臨時(shí)指針，該指針指向當(dāng)前應(yīng)該插入nextIn的結(jié)點(diǎn)，插入后更新，初始值為頂點(diǎn)結(jié)點(diǎn)，使用空間換時(shí)間。

為每個(gè)頂點(diǎn)設(shè)置臨時(shí)指針的作用：

確定各個(gè)結(jié)點(diǎn)的nextIn。

對(duì)應(yīng)代碼：

OrthogonalNode[] tempColumnNodes = new OrthogonalNode[numNodes];for (int i = 0; i < numNodes; i++) {tempColumnNodes[i] = headers[i];} // Of for ifor (int i = 0; i < numNodes; i++) {tempNode = headers[i].nextOut;while (tempNode != null) {tempColumnNodes[tempNode.column].nextIn = tempNode;tempColumnNodes[tempNode.column] = tempNode;tempNode = tempNode.nextOut;} // Of while} // Of for i

完整代碼：

package day22;public class OrthogonalList {/*** An inner class for adjacent node.*/class OrthogonalNode {/*** The row index.*/int row;/*** The column index.*/int column;/*** The next out node.*/OrthogonalNode nextOut;/*** The next in node.*/OrthogonalNode nextIn;/*** ********************** The first constructor.* * @param paraRow The row.* @param paraColumn The column.***********************/public OrthogonalNode(int paraRow, int paraColumn) {row = paraRow;column = paraColumn;nextIn = null;nextOut = null;}// Of OrthogonalNode}// Of class OrthogonalNode/*** The number of nodes. This member variable may be redundant since it is always* equal to headers.length.*/int numNodes;/*** The headers for each row.*/OrthogonalNode[] headers;/*** ********************** The first constructor.* * @param paraMatrix The matrix indicating the graph.***********************/public OrthogonalList(int[][] paraMatrix) {numNodes = paraMatrix.length;// Step 1. Initialize. The data in the headers are not meaningful.OrthogonalNode tempPreviousNode, tempNode;headers = new OrthogonalNode[numNodes];// Step 2. Link to its out nodes.for (int i = 0; i < numNodes; i++) {headers[i] = new OrthogonalNode(i, -1);tempPreviousNode = headers[i];for (int j = 0; j < numNodes; j++) {if (paraMatrix[i][j] != 0) {// Create a new node.tempNode = new OrthogonalNode(i, j);// LinktempPreviousNode.nextOut = tempNode;tempPreviousNode = tempNode;} // Of if} // Of for j} // Of for i// Step 3. Link to its in nodes.OrthogonalNode[] tempColumnNodes = new OrthogonalNode[numNodes];for (int i = 0; i < numNodes; i++) {tempColumnNodes[i] = headers[i];} // Of for ifor (int i = 0; i < numNodes; i++) {tempNode = headers[i].nextOut;while (tempNode != null) {tempColumnNodes[tempNode.column].nextIn = tempNode;tempColumnNodes[tempNode.column] = tempNode;tempNode = tempNode.nextOut;} // Of while} // Of for i}// Of OrthogonalList/************************ Overrides the method claimed in Object, the superclass of any class.**********************/public String toString() {String resultString = "Out arcs: \r\n";OrthogonalNode temNode;for (int i = 0; i < numNodes; i++) {temNode = headers[i].nextOut;while (temNode != null) {resultString += "(" + temNode.row + "," + temNode.column + ") ";temNode = temNode.nextOut;} // Of whileif (headers[i].nextOut != null) {resultString += "\r\n";} // Of if} // Of for i;resultString += "In arcs: \r\n";for (int i = 0; i < numNodes; i++) {temNode = headers[i].nextIn;while (temNode != null) {resultString += "(" + temNode.row + "," + temNode.column + ") ";temNode = temNode.nextIn;} // Of whileif (headers[i].nextIn != null) {resultString += "\r\n";} // Of if} // Of for i;return resultString;}// Of toString/*** ********************** @Title: main* @Description: TODO(The entrance of the program.)** @param argsn Not used now.***********************/public static void main(String args[]) {// int[][] tempMatrix = { { 0, 1, 0, 0 }, { 0, 0, 0, 1 }, { 1, 0, 0, 0 }, { 0,// 1, 1, 0 } };int[][] tempMatrix = { { 0, 1, 1, 0 }, { 0, 0, 0, 0 }, { 1, 0, 0, 1 }, { 1, 1, 1, 0 } };OrthogonalList tempList = new OrthogonalList(tempMatrix);System.out.println("The data are:\r\n" + tempList);}// Of main}// Of class OrthogonalList

運(yùn)行結(jié)果：

總結(jié)

以上是生活随笔為你收集整理的Day22——十字链表的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。