PYTHON实现DFS算法

 class Vertice:
   def __init__(self,index):
     self.no = index
     self.color = 0 # 0:white 1 gray 2 black
     self.vt = 0
   def getNextV(self):
     return self.nextV
   def setNextV(self,*nextVertice):
       self.nextV = nextVertice
   def setColor(self,color):
     self.color = color
   def getColor(self):
     return self.color
   def incVt(self):
     self.vt += 1
   def getVt(self):
     return self.vt

 v1 = Vertice(1)
 v2 = Vertice(2)
 v3 = Vertice(3)
 v4 = Vertice(4)
 v5 = Vertice(5)

 v1.setNextV(v2,v5)
 v2.setNextV(v1,v5,v4,v3)
 v3.setNextV(v2,v4)
 v4.setNextV(v2,v3,v5)
 v5.setNextV(v1,v2,v4)

 v100 = Vertice(100)
 v100.setNextV(v1,v2,v3,v4,v5)

 def DFS_Visit(v):
   v.setColor(1)
   v.incVt()
   for it in v.getNextV():
     if it.getColor() == 0:
         DFS_Visit(it)
   v.setColor(2)

 DFS_Visit(v100)

 for it in v100.getNextV():
     print it.getVt()