الرجاء المساعدة في حل هذا البرنامج قبل 18/4/2010
Part1:
o Assignment for the lab.
The code for the linked list implementation of a graph is provided in the files edge.h, vertex.h, graph.h, vertex-edge.cpp, graph.cpp, graphtest.cpp, and Makefile.
Your assignment is to write and test the following methods of the class Graph:
o NumVertexes() -- returns the number of vertexes in the graph,
o NumEdgesFrom(char) -- returns the number of edges from a vertex with the data given in the argument. If there is no such vertex, the method returns 0.
o NumEdges() -- returns the total number of edges in the graph.
o NumEdgesTo(char) -- returns the number of edges going into the vertex.
o (optional) bool RemoveEdge(char, char) -- removes an edge between the two vertexes. Returns 'false' if there is no such edge.
o (optional) bool RemoveVertex(char) -- removes the vertex. Returns 'false' if there is no such vertex or if the vertex has outcoming or incoming edges.
You may add methods to the classes Vertex and Edge as needed.
* Please submit the code for 2 of the methods you have written.
Part2:
1. implement kruskals algorithm using linked list representation
(Note: you must use the linked list representation of the graph you tested in a part1)
2. implement kruskals implementation using tree based representation.
في الملف اجابة الجزء الاول الرجاء المساعدة في الجزء الثاني واضافته للجزء الاول
الرجاء ارسال الاجابة على الايميل moha4_1989@hotmail.com