实验 图最短路径.pdfVIP

1. // Graph.h: interface for the CGraph class. 2. // 3. ////////////////////////////////////////////////////////////////////// 4. 5. #ifndef __GRAPH_H 6. #define __GRAPH_H 7. 8. #include vector 9. #include iostream 10. #define INFINITY 11. 12. using namespace std; 13. 14. class CGraph 15. { 16. public: 17. class CVertex{ 18. public: 19. CVertex(){ 20. } 21. CVertex(const CVertex v){ 22. this-known = v.known; 23. this-dist = v.dist; 24. this-prev = v.prev; 25. this-neighbors = v.neighbors; 26. this-weights = v.weights; 27. } 28. 29. bool known; 30. double dist; 31. int prev; 32. vectorint neighbors; 33. vectordouble weights; 34. }; 35. 36. public: 37. CGraph(); 38. virtual ~CGraph(); 39. 40. void setVertexNum(int n){ 41. vertexes.clear(); 42. for(int i=0; in; i++){ 43. vertexes.push_back(CVertex()); 44. } 45. } 46. 47. // insertEdge(0,1,2) 48. 49. void insertEdge(int start, int end, double w){ 50. vertexes[start].neighbors.push_back(end); 51. vertexes[start].weights.push_back(w); 52. } 53. 54. 55. void dijistra(int start){ 56. for(int i=0; ivertexes.size(); i++){ 57. vertexes[i].known = false; 58. vertexes[i].dist = INFINITY; 59. vertexes[i].prev = -1