C++ Graph Program - StudentOfFortune.com

Question

Asked by:

Rating : No Rating
Questions Asked: 1
Tutorials Posted: 0

$25.00 C++ Graph Program

From Computer-Science: Object-Oriented-Programming
Closed, but you can still post tutorials
Due on Feb. 28, 2009
Asked on Feb 27, 2009 at 2:20:21PM

Q:
Write a program that reads and stores the names of persons and the names of job positions in the vertices of a graph. Two vertices will be connected if one of them represents a person and the other a job position for which that person is qualified. The program should allow the user to specify one of the following options:

* Insert (a) a new applicant or (b) a new job position into the graph.
* Delete (a) an applicant or (be a job position from the graph.
* List all persons qualified for a specified job position.
* List all job positions for which a specified person is qualified.

You will need to develop the following functions to make this work:

* Insert a new vertex, given a specification of all vertices adjacent to it.
* Search the graph for a vertex that stores a given data item and retrieve information about that item and/or update the information.
* Delete a vertex containing a given data item and all edges incident to it.
* Find all vertices adjacent to a given vertex.

Attachments:

Available Tutorials to this Question

Posted by:

rainman
Rating (40): A+
Questions Asked: 2
Tutorials Posted: 174, earned $906.64

$25.00 C++ Graph Tutorial, Menu Driven, Does Everything Asked, Compiled, Tested, Commented.

This tutorial was purchased 1 time and rated A+ by students like you.
Posted on Feb 27, 2009 at 5:31:19PM

A:
Preview: ... using namespace std; //Holds the name of a person or position class Vertex { public: Vertex(string n); string getName(); private: string name; }; Vertex::Vertex(string n) { name = n; } string Vertex::getName() { return name; } //Connection between the person and the position class Edge { public: Edge(Vertex *a, Vertex* p); Vertex* getApplicant(); Vertex* getPosition(); private: Vertex* applicant; Vertex* position; }; Edge::Edge(Vertex *a, Vertex* p) { applicant = a; position = p; } Vertex* Edge::getApplicant() { return applicant; } Vertex* Edge::getPosition() { return position; } class Graph { public: Graph(); ~Graph(); void addVertex(string position); void addVertex(string name, string qualified); void remove(string name); void clear(); void displayAll(); //For debugging void displayApplicants(string job); void displayJobs(string applicant); private: vector<Vertex*> vertices; vector<Edge*> edges; Vertex* getVertexByName(string name); }; Graph::Graph() {} Graph::~Graph() { clear(); } void Graph::clear() { //This will delete any allocated memory stored in the vectors. vector<Vertex*>::iterator vertIter; for (vertIter = vertices.begin(); vertIter != vertices.end(); ++vertIter) delete *vertIter; vertices.clear(); vector<Edge*>::iterator edgeIter; for (edgeIter = edges.begin(); edgeIter != edges.end(); ++edgeIter) delete *edgeIter; edges.clear(); } //This is to add a job position vertex, if it is not already. void Gra ...

The full tutorial is about 2476 words long plus attachments.

Attachments:
main.cpp (8K) (Preview)