linkedwgraph.h

来自「这是数据结构、算法与应用-C++语言描述的代码」· C头文件 代码 · 共 70 行

// linked adjacency list representation of a weighted graph

#ifndef linkedWGraph_
#define linkedWGraph_


#include <iostream>
#include <sstream>
#include "linkedWDigraph.h"
#include "weightedEdge.h"


using namespace std;

template <class T>
class linkedWGraph : public linkedWDigraph<T>
{
   public:
      linkedWGraph(int numberOfVertices = 0)
         : linkedWDigraph<T>(numberOfVertices) {}
   
      bool directed() const {return false;}
   
      void insertEdge(edge<T> *theEdge)
      {// Insert an edge.
         int oldE = e;
         linkedWDigraph<T>::insertEdge(theEdge);
         if (e > oldE)
         {// new edge
            linkedWDigraph<T>::insertEdgeNoCheck(new weightedEdge<T>
                              (theEdge->vertex2(),
                               theEdge->vertex1(),
                               theEdge->weight()));
            e--;  // compenstate for extra increment
         }
      }
      
      void insertEdgeNoCheck(edge<T> *theEdge)
      {// Insert an edge. No validation checks performed.
            linkedWDigraph<T>::insertEdgeNoCheck(theEdge);
            linkedWDigraph<T>::insertEdgeNoCheck(new weightedEdge<T>
                              (theEdge->vertex2(),
                               theEdge->vertex1(),
                               theEdge->weight()));
            e--;
      }
   
      void eraseEdge(int i, int j)
      {
         int oldE = e;
         linkedWDigraph<T>::eraseEdge(i, j);
         if (oldE > e) // edge exists
         {
            linkedWDigraph<T>::eraseEdge(j, i);
            e++;
         }
      }
      
      int degree(int theVertex) const
      {
         checkVertex(theVertex);
         return aList[theVertex].size();
      }

      int outDegree(int theVertex) const {return degree(theVertex);}
      
      int inDegree(int theVertex) const {return degree(theVertex);}
};
#endif