程式碼如下：

const int DefaultVertices = 100;
const int maxWeight = 1000;
template <class T, class E>
class Graphmtx
{
    friend istream& operator >> (istream& in, Graphmtx<T, E>&	G);//輸入
    friend ostream& operator << (ostream& out, Graphmtx<T, E>& G);//輸出

private:
    int maxVertices;//最大頂點個數
    int numEdges;//當前邊數
    int numVertices;//當前頂點數
    int getVertexPos(T vertex)
    {

        for(int i = 0; i < numVertices; i++)
        {
            if(VerticesList[i]==vertex)return i;
        }
        return -1;
    }
    ;//給出頂點vertex在圖中的位置
    T *VerticesList;//頂點表
    E **Edge;//鄰接矩陣
public:
    Graphmtx(int sz = DefaultVertices);//構造方法
    ~Graphmtx()
    {
        delete []VerticesList;    //析構方法
        delete[]Edge;
    }
    T getValue(int i)
    {
        return i>=0&&i<=numVertices? VerticesList[i]:NULL;
    }//取頂點i的值

    E getWeight(int v1, int v2)//返回邊(v1,v2)上的權值
    {
        return v1!=-1&&v2!=-1 ? Edge[v1][v2]:NULL;
    }

    int getFirstNeighbor(int v);//取頂點v的第一個鄰接頂點
    int getNextNeighbor(int v, int w);
    bool insertVertex(const T& vertex);//插入頂點vertex
    bool insertEdge(int v1, int v2, E cost);//插入邊(v1,v2),權值為cost
    bool removeVertex(int v);//刪除頂點v和所有與他相關的邊
    bool removeEdge(int v1, int v2);//刪除邊(v1, v2)
};

template <class T, class E>
Graphmtx<T,E>::Graphmtx(int sz){
//建構函式
maxVertices = sz;
numEdges = 0;
numVertices = 0;
int i, j;
VerticesList = new T[maxVertices];
Edge = (E**)new E*[maxVertices];
for(i = 0; i < maxVertices; i++){

      Edge[i] = new E*[maxVertices];
}

for(i = 0; i < maxVertices; i++){
for(j = 0; j < maxVertices; j++){
      Edge[i][j] = (i == j)? 0: maxWeight;
}
}
}

//用鄰接矩陣表示的圖的存取操作的實現
template <class T, class E>
int Graphmtx<T, E>::getFirstNeighbor(int v){
if(v!=-1){
      for(int col = 0; col < numVertices; col++){
            if(Edge[v][col]>0 && Edge[v][col]<maxWeight)return col;
      }
      return -1;
}
};

template <class T, class E>
int Graphmtx<T, E>::getNextNeighbor(int v, int w){
if(v!=-1&&w!=-1){
      for(int col = w + 1; col < numVertices; col++){
            if(Edge[v][col]>0&&Edge[v][col]<maxWeight){
                  return col;
            }
            return -1;
      }
}
}
//插入頂點
template <class T, class E>
bool Graphmtx<T, E>::insertVertex(const T& vertex){
if(numVertices==maxVertices)return false;
VerticesList[numVertices+1] = vertex;
return true;
}
//刪除頂點，要刪除所有與頂點v有關的邊
//這個函式還是非常好的
template <class T, class E>
bool Graphmtx<T, E>::removeVertex(int v){
      if(v<0||v>numVertices)return false;
      if(numVertices == 1)return false;

VerticesList[v] = VerticesList[numVertices-1];
for(int i = 0; i < maxVertices; i++){
      if((Edge[i][v]>0&&Edge[i][v]<maxWeight)||(Edge[v][i]>0&&Edge[v][i]<maxWeight))numEdges--;
}

for(int i = 0; i < numVertices; i++){
            Edge[i][v] = Edge[i][numVertices-1];
}
numVertices--;
for(int i = 0; i < numVertices; i++){
            Edge[v][i] = Edge[numVertices][i];
}
return true;
}

//插入邊
template <class T, class E>
bool Graphmtx<T, E>::insertEdge(int v1, int v2, E cost){
if(v1>=0&&v1<numVertices&&v2>=0&&v2<numVertices&&Edge[v1][v2]!=maxWeight){
      Edge[v1][v2]=Edge[v2][v1]=cost;
      numEdges++;//記得邊的數量是要加上1
      return true;
}
else return false;
}

//刪除邊
template <class T, class E>
bool Graphmtx<T, E>::removeEdge(int v1, int v2){
if(v1>=0&&v1<numVertices&&v2>=0&&v2<numVertices&&Edge[v1][v2]>0&&Edge[v1][v2]<maxWeight){
      Edge[v1][v2]=Edge[v2][v1]=maxWeight;
      numEdges--;
      return true;
}
else return false;
}

//輸入
template <class T, class E>
istream& operator>>(istream& in, Graphmtx<T,E>& G){
int i, j, k, n, m;
T e1, e2;
E weight;
in>>n>>m;
for(i = 0; i < n; i++){
      in>>e1;
      G.insertVertex(e1);
}
i = 0;
while(i<m){
      in>>e1>>e2>>weight;
      j = G.getVertexPos(e1);k=G.getVertexPos(e2);
      if(j==-1||k==-1)
            cout<<"邊兩端頂點資訊有誤，請重新輸入"<<endl;
      else{
            G.insertEdge(j, k, weight);i++;
      }
}
return in;
}

//輸出
template <class T, class E>
ostream& operator>>(ostream& out, Graphmtx<T,E>& G){
int i, j, n, m;
T e1, e2;
E w;
n = G.NumberOfVertices();
m = G.NumberOfEdges();
out<<n<<","<<m<<endl;
for(i = 0; i < n; i++){
      for(j = i + 1; j < n; j++){
            w=G.getWeight(i, j);
            if(w>0&&w<maxWeight){
                  e1 = G.getValue(i);
                  e2 = G.getValue(j);
                  out<<"("<<e1<<","<<e2<<","<<w<<"("<<endl;
            }
      }
}
return out;
}