You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
#include <iostream>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
|
|
|
|
#include "graph.h"
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
Graph<int> g;
|
|
|
|
|
|
|
|
assert(g.empty() == true);
|
|
|
|
assert(g.numberOfVertices() == 0);
|
|
|
|
assert(g.numberOfEdges() == 0);
|
|
|
|
|
|
|
|
|
|
|
|
int a = 2;
|
|
|
|
int b = 5;
|
|
|
|
assert(g.addEdge(a, b) == false);
|
|
|
|
|
|
|
|
assert(g.addVertex(a) == true);
|
|
|
|
assert(g.addVertex(a) == false);
|
|
|
|
assert(g.empty() == false);
|
|
|
|
assert(g.numberOfVertices() == 1);
|
|
|
|
|
|
|
|
assert(g.addEdge(a, b) == false);
|
|
|
|
|
|
|
|
assert(g.addVertex(b) == true);
|
|
|
|
assert(g.numberOfVertices() == 2);
|
|
|
|
|
|
|
|
assert(g.numberOfEdges() == 0);
|
|
|
|
assert(g.addEdge(a, b) == true);
|
|
|
|
|
|
|
|
assert(g.numberOfEdges() == 1);
|
|
|
|
|
|
|
|
assert(g.edgesBetween(2, 5).size() == 1);
|
|
|
|
assert(g.edgesBetween(5, 2).size() == 0);
|
|
|
|
assert(g.neighboursOf(2).size() == 1);
|
|
|
|
assert(g.neighboursOf(5).size() == 0);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|