Description
: In this lab implement a Graph with an adjacency list.
Implement the following class:
| #ifndef GRAPHAL_H
#define GRAPHAL_H /* This class represents a weighted driected graph via an adjacency list. * Vertices are given an index, starting from 0 and ascending * Class W : W represent the weight that can be associacted with an edge. * We will not weight the vertices. */ template<class W> class GraphAL { private: /* You fill out. */ public: /* Initialize an empty graph. */ GraphAL(); /* Initialize the Graph with a fixed number of vertices. */ GraphAL(const int vertices); /* Deconstructor shall free up memory */ ~GraphAL(); /* Adds amt vertices to the graph. */ void addVertices(int amt); /* Removes a vertex. * return wheter sucessful or not */ bool removeVertex(int idx); /* Adds an edge with weight W to the graph. */ bool addEdge(const int start, const int end, const W &weight); /* * Remove edge from graph. */ bool removeEdge(const int start, const int end); void depthFirstTraversal(void (*visit)(const int node)); void breadthFirstTraversal(void (*visit)(const int node)); |
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
| /*
* Return adjacent weight from start to end (or -1 if they are * not adjacent. */ W adjacent(const int start, const int end); /* Returns the TOTAL weight of the minimum spanning tree with the * given starting node. * You must use Prim’s MST. */ W prims(const int start); /* Print out the Graph */ void print() const; }; #include “graphal.cpp” #endif |
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
Write some test cases:
Create some test cases, using cxxtestgen, that you believe would cover all aspects of your code.
Memory Management:
Now that are using new, we must ensure that there is a corresponding delete to free the memory. Ensure there are no memory leaks in your code! Please run Valgrind on your tests to ensure no memory leaks!
