Complete the unweighted graph implementation provided. You will need to implemen

Question

Complete the unweighted graph implementation provided. You will need to implement the various functions (constructor, addVertex, addEdge, print) and determine the data members. It is an unweighted graph; you can choose a directed/or undirected. This is c++ code.

- graph() constructs an empty graph

- addVertex() adds a vertex to your graph and returns its nodeid (an unsigned int). Starts at 0, then 1, etc.

- addEdge(to,from) adds an edge from nodeid to to nodeid from. If your graph is undirected, also adds the other edge.

- print() prints out the structure of the graph (node 0 is connected to nodes i, j, k and etc)

Explanation / Answer

#include #include #include using namespace std; class Vertex; class Edge { public: Edge(Vertex *org, Vertex *dest, int dist) { origin = org; destination = dest; distance = dist; } Vertex* getOrigin() {return origin;} Vertex* getDestination() {return destination;} int getDistance() {return distance;} private: Vertex* origin; Vertex* destination; int distance; }; class Vertex { public: Vertex(string id) { name = id; } void addEdge(Vertex *v, int dist) { Edge newEdge(this, v, dist); edges.push_back(newEdge); } void printEdges() { cout

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.