?? adjacencywgraph.cpp
字號:
// test adjacency matrix representation of an undirected weighted graph
#include <iostream>
#include "adjacencyWGraph.h"
#include "weightedEdge.h"
using namespace std;
void main(void)
{
adjacencyWGraph<int> g(4);
cout << "Number of Vertices = " << g.numberOfVertices() << endl;
cout << "Number of Edges = " << g.numberOfEdges() << endl;
cout << endl;
g.insertEdge(new weightedEdge<int>(2, 4, 1));
g.insertEdge(new weightedEdge<int>(1, 3, 2));
g.insertEdge(new weightedEdge<int>(2, 1, 3));
g.insertEdge(new weightedEdge<int>(1, 4, 4));
g.insertEdge(new weightedEdge<int>(4, 2, 5));
cout << "The graph is" << endl;
cout << "Number of Vertices = " << g.numberOfVertices() << endl;
cout << "Number of Edges = " << g.numberOfEdges() << endl;
cout << g << endl;
cout << endl;
g.eraseEdge(2,1);
cout << "The graph after deleting (2,1) is" << endl;
cout << "Number of Vertices = " << g.numberOfVertices() << endl;
cout << "Number of Edges = " << g.numberOfEdges() << endl;
cout << g << endl;
cout << "existsEdge(3,1) = " << g.existsEdge(3,1) << endl;
cout << "existsEdge(1,3) = " << g.existsEdge(1,3) << endl;
cout << "inDegree(3) = " << g.inDegree(3) << endl;
cout << "outDegree(1) = " << g.outDegree(1) << endl;
cout << "Number of Vertices = " << g.numberOfVertices() << endl;
cout << "Number of Edges = " << g.numberOfEdges() << endl;
cout << endl;
// test iterator
cout << "Edges incident to vertex 4" << endl;
vertexIterator<int>* gi = g.iterator(4);
pair<int,int>* thePair;
while((thePair = gi->next()) != NULL)
cout << thePair->first << " " << thePair->second << endl;
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -