1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228
| template<class T> class AdjGraph { private: T m_vertex[MAX_VERTEX_NUM]; int m_nAdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int m_nVertexNum; int m_nGraphType; public: AdjGraph(int nGraphType); bool DFSTraverse(int nV, int); void DFS(int nV, bool bVisited[]); bool DFSTraverse(int nV); bool BFSTraverse(int nV); int GetVertexNum(); int GetFirstEdge(int nV); int GetNextEdge(int nV1, int nV2); bool AddOneVertex(const T& vertex); bool AddOneEdge(int nV1, int nV2, int nWeight); bool GetVertexValue(int nV, T& vertex); bool IsEdge(int nV1, int nV2); bool SetEdgeWeight(int nV1, int nV2, int nWeight); bool GetEdgeWeight(int nV1, int nV2, int nWeight); };
template<class T> AdjGraph<T>::AdjGraph(int nGraphType) { int nI, nJ; m_nGraphType = nGraphType; m_nVertexNum = 0; for (nI = 0; nI < MAX_VERTEX_NUM; nI++) for (nJ = 0; nJ < MAX_VERTEX_NUM; nJ++) m_nAdjMatrix[nI][nJ] = INFINITY01; }
template<class T> int AdjGraph<T>::GetVertexNum() { return m_nVertexNum; }
template<class T> bool AdjGraph<T>::IsEdge(int nV1, int nV2) { return m_nAdjMatrix[nV1][nV2] != INFINITY01; }
template<class T> int AdjGraph<T>::GetFirstEdge(int nV) { int nJ; if (nV < 0 || nV >= m_nVertexNum) return -1; for (nJ = 0; nJ < m_nVertexNum; nJ++) if (IsEdge(nV, nJ)) return nJ; return -1; }
template<class T> int AdjGraph<T>::GetNextEdge(int nV1, int nV2) { int nJ; if (!IsEdge(nV1, nV2)) return -1; for (nJ = nV2 + 1; nJ < m_nVertexNum; nJ++) if (IsEdge(nV1, nJ)) return nJ; return -1; }
template<class T> bool AdjGraph<T>::AddOneVertex(const T& vertex) { if (m_nVertexNum >= MAX_VERTEX_NUM) return false; m_vertex[m_nVertexNum] = vertex; m_nVertexNum++; return true; }
template<class T> bool AdjGraph<T>::GetVertexValue(int nV, T& vertex) { if (nV < 0 || nV >= m_nVertexNum) return false; vertex = m_vertex[nV]; return true; }
template<class T> bool AdjGraph<T>::AddOneEdge(int nV1, int nV2, int nWeight) { if (nV1 < 0 || nV1 >= m_nVertexNum || nV2 < 0 || nV2 >= m_nVertexNum || IsEdge(nV1, nV2)) return false; m_nAdjMatrix[nV1][nV2] = nWeight; if (m_nGraphType == 0) m_nAdjMatrix[nV2][nV1] = nWeight; return true; }
template<class T> bool AdjGraph<T>::SetEdgeWeight(int nV1, int nV2, int nWeight) { if (!IsEdge(nV1, nV2)) return false; m_nAdjMatrix[nV1][nV2] = nWeight; return true; }
template<class T> bool AdjGraph<T>::GetEdgeWeight(int nV1, int nV2, int nWeight) { if (!IsEdge(nV1, nV2)) return false; nWeight = m_nAdjMatrix[nV1][nV2]; return true; }
template<class T> bool AdjGraph<T>::BFSTraverse(int nV) { LinkQueue<int> queue; int nVisitVertex, nVertex, nBegVertex = nV; bool bVisited[MAX_VERTEX_NUM]; T vertex; if (nV<0 || nV>=m_nVertexNum) return false; memset(bVisited, 0, sizeof(bVisited)); while (1) { queue.Insert(nBegVertex); bVisited[nBegVertex] = true; while (!queue.IsEmpty()) { queue.Delete(nVisitVertex); GetVertexValue(nVisitVertex, vertex); cout << vertex << ' '; nVertex = GetFirstEdge(nVisitVertex); while (nVertex != -1) { if (bVisited[nVertex] == false) { queue.Insert(nVertex); bVisited[nVertex] = true; } nVertex = GetNextEdge(nVisitVertex, nVertex); } } int n = nBegVertex + 1; for (; n < m_nVertexNum + nV; n++) { if (bVisited[n % m_nVertexNum] == false) { nBegVertex = n % m_nVertexNum; break; } } if (n == m_nVertexNum + nV) break; } return true; }
template<class T> bool AdjGraph<T>::DFSTraverse(int nV, int) { int nBegVertex; bool bVisited[MAX_VERTEX_NUM]; if (nV < 0 || nV >= m_nVertexNum) return false; memset(bVisited, 0, sizeof(bVisited)); for (nBegVertex=nV; nBegVertex < m_nVertexNum + nV; nBegVertex++) { if (bVisited[nBegVertex % m_nVertexNum] == false) DFS(nBegVertex, bVisited); } return true; }
template<class T> void AdjGraph<T>::DFS(int nV, bool bVisited[]) { T vertex; int nVertex; GetVertexValue(nV, vertex); cout << vertex << ' '; bVisited[nV] = true; nVertex = GetFirstEdge(nV); while (nVertex != 1) { if (bVisited[nVertex] == false) DFS(nVertex, bVisited); nVertex = GetNextEdge(nV, nVertex); } }
|