代碼如下:

#include <iostream> #include <queue> using namespace std; typedef int InfoType; typedef int VertexType; const int MaxVertexNum = 30;class ArcNode {friend class OLGraph;friend class VertexNode; private:int tailvertex, headvertex;ArcNode *hlink, *tlink;InfoType info; };class VertexNode {friend class OLGraph; private:VertexType vertex;ArcNode *firstin, *firstout; };class OLGraph { public:OLGraph() {Init_vis();};void CreateOLgraph();int GetOut_degree(VertexType v);int GetIn_degree(VertexType v);void Init_vis(){for (int i = 0; i < MaxVertexNum; i++) vis[i] = false;//注意是MaxVertexNum，不是vertexNum};void DFS_Node(int i);void BFS_Node(int i);void DFStraverse();void BFStraverse();int LocateVertex(VertexType v);//通過結(jié)點信息查找其序號void Visit(int v){cout << xlist[v].vertex << " ";}; private:void DFS(int i);VertexNode xlist[MaxVertexNum];int vertexNum, edgeNum;bool vis[MaxVertexNum]; };int OLGraph::LocateVertex(VertexType v) {for (int i = 0; i < vertexNum; i++){if (xlist[i].vertex == v) return i;} }void OLGraph::CreateOLgraph() {ArcNode *p;cout << "請輸入頂點數(shù)和邊數(shù)" << endl;cin >> vertexNum >> edgeNum;for (int i = 0; i < vertexNum; i++){cout << "請輸入第" << i << "個頂點信息:" << endl;cin >> xlist[i].vertex;xlist[i].firstin = nullptr;xlist[i].firstout = nullptr;}cout << "下面輸入邊表信息" << endl;for (int i = 0; i < edgeNum; i++){VertexType v1, v2;//v1--->v2cout << "輸入邊<i,j>對應(yīng)的頂點信息i,j" << endl;cin >> v1 >> v2;int p_v1 = LocateVertex(v1);int p_v2 = LocateVertex(v2);p = new ArcNode;p->tailvertex = p_v1;p->headvertex = p_v2;p->tlink = xlist[p_v1].firstout;xlist[p_v1].firstout = p;p->hlink = xlist[p_v2].firstin;xlist[p_v2].firstin = p;} }int OLGraph::GetOut_degree(VertexType v) {int i = LocateVertex(v);ArcNode *p;int cnt = 0;for (p = xlist[i].firstout; p; p = p->tlink) cnt++;return cnt; }int OLGraph::GetIn_degree(VertexType v) {int i = LocateVertex(v);ArcNode *p;int cnt = 0;for (p = xlist[i].firstin; p; p = p->hlink) cnt++;return cnt; }void OLGraph::DFS(int i) {vis[i] = true;Visit(i);ArcNode *p;for (p = xlist[i].firstout; p; p = p->tlink){if (!vis[p->headvertex]){vis[p->headvertex] = true;DFS(p->headvertex);}} }void OLGraph::DFS_Node(int i) {DFS(i);cout << endl;Init_vis(); }void OLGraph::BFS_Node(int i) {queue<int>q;vis[i] = true;q.push(i);ArcNode *p;while (q.size()){int t = q.front();q.pop();Visit(t);for (p = xlist[t].firstout; p; p = p->tlink){if (!vis[p->headvertex]){vis[p->headvertex] = true;q.push(p->headvertex);}}}cout << endl;Init_vis(); }void OLGraph::DFStraverse() {for (int i = 0; i < vertexNum; i++){if (!vis[i]){vis[i] = true;DFS(i);}}cout << endl;Init_vis(); }void OLGraph::BFStraverse() {for (int i = 0; i < vertexNum; i++){if (!vis[i]){queue<int>q;vis[i] = true;q.push(i);ArcNode *p;while (q.size()){int t = q.front();q.pop();Visit(t);for (p = xlist[t].firstout; p; p = p->tlink){if (!vis[p->headvertex]){vis[p->headvertex] = true;q.push(p->headvertex);}}}}}cout << endl;Init_vis(); }int main() {OLGraph g;g.CreateOLgraph();cout << "bfs:" << endl;g.BFStraverse();cout << "dfs:" << endl;g.DFStraverse();VertexType v;cin >> v;cout << "結(jié)點" << v << "的入度為:" << endl;cout<<g.GetIn_degree(v)<<endl;cout << "結(jié)點" << v << "的出度為:" << endl;cout << g.GetOut_degree(v) << endl;cin >> v;cout << "結(jié)點" << v << "的入度為:" << endl;cout << g.GetIn_degree(v) << endl;cout << "結(jié)點" << v << "的出度為:" << endl;cout << g.GetOut_degree(v) << endl;int p;cin >> p;g.BFS_Node(p);g.DFS_Node(p);return 0; }

測試結(jié)果:

總結(jié)

以上是生活随笔為你收集整理的C++ class实现十字链表存储的图(完整代码)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

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