B00015 C++实现的图类-白红宇

B00015 C++实现的图类

阅读量：6902 次

发布时间：2019-06-27

本文共 5448 字，大约阅读时间需要 18 分钟。

代码来自：。

graph.h文件内容如下：

#include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         #include
          
           #include
           
            #define MAXSIZE 100using namespace std;class Vertex{ private: pair
            
              > V; public: Vertex(){}; Vertex(int); bool addAdjVertex(int); friend bool operator==(Vertex const &, Vertex const &); friend bool operator<(Vertex const &, Vertex const &); friend bool operator>(Vertex const &, Vertex const &);};class Edge{ private: int weight; int src; int dst; public: Edge(){}; Edge(int, int, int); ~Edge(){}; friend bool operator==(Edge const &, Edge const &); //friend bool operator<(Edge const &, Edge const &); //friend bool operator>(Edge const &, Edge const &); int getWeight(); int getSource(); int getDest();};class Graph{ private: map

> vertices; list

edges; set

visited; public: Graph(); bool addVertex(int); bool addEdge(int, int, int); bool deleteVertex(int); void print(); void bfs(); void dfstraversal(); void dfs(int, list

); void pathSum(int); void findpath(int, int, char *, int, int); void bellman(); list

topologicalSort(); void topo();};

graph.cpp文件内容如下：

#include
    
     Vertex::Vertex(int v){}bool Vertex::addAdjVertex(int v) {}list
     
       order;bool operator==(Vertex const &v1, Vertex const &v2){    return true;}bool operator<(Vertex const &v1, Vertex const &v2){    return true;}bool operator>(Vertex const &v1, Vertex const &v2){    return true;}Edge::Edge(int a, int s1, int s2){    weight = a;    src = s1;    dst = s2;}int Edge::getWeight(){return weight;}int Edge::getSource(){return src;}int Edge::getDest(){return dst;}bool operator==( Edge const &e1, Edge const & e2){    if(e1.weight==e2.weight && e1.src==e2.src && e1.dst == e2.dst)        return true;    return false;}Graph::Graph(){}bool Graph::addVertex(int v){    list
      
        adjList;    vertices.insert(pair

>(v, adjList)); }bool Graph::addEdge(int wt, int s, int d){ edges.push_back(Edge(wt, s, d)); map

>::iterator sit = vertices.find(s); if(sit!=vertices.end()) sit->second.push_back(d); else { list

adjList; adjList.push_back(d); vertices.insert(pair

>(s, adjList)); } sit = vertices.find(d); if(sit == vertices.end()) { list

adjList1; vertices.insert(pair