图的实现主要分两部:顶点的实现(Vertex类)图的实现(Graph类)
顶点的实现(Vertex类的实现)如下:
# 顶点实现:Vertex类的实现
class Vertex:
def __init__(self,key):
self.id=key
self.connectedTo={}
def addNeighbor(self,nbr,weight=0):
self.connectedTo[nbr]=weight
def __str__(self):
return str(self.id)+'connectedTO'+str([x.id for x in self.connectedTo])
def getConnections(self):
return self.connectedTo.keys()
def getId(self):
return self.id
def getWeight(self,nbr):
return self.connectedTo[nbr]
#顶点类的扩展版本
图的实现(Graph类的实现)代码如下:
from 数据结构与算法.图及其算法.顶点的实现 import Vertex
# 图类的实现(Graph类)
class Graph:
def __init__(self):
self.vertList={}
self.numVertices=0
def addVertex(self,key):
self.numVertices=self.numVertices+1
newVertex=Vertex(key)
self.vertList[key]=newVertex
return newVertex
def getVertex(self,n):
if n in self.vertList:
return self.vertList[n]
else:
return None
def __contains__(self, n):
return n in self.vertList
def addEdge(self,f,t,cost=0):
if f not in self.vertList:
nv=self.addVertex(f)
if t not in self.vertList:
nv=self.addVertex(t)
self.vertList[f].addNeighbor(self.vertList[t],cost)
def getVerteices(self):
return self.vertList.keys()
def __iter__(self):
return iter[self.vertList.Values()]