#!/usr/bin/env python
from __future__ import generators
from SimPy.Simulation import *
##  $Revision: 1.1.1.5 $ $Date: 2006/02/02 13:35:45 $ 
""" Author: Klaus Muller """

class node:
    def __init__(self):
        self.reached=0
  
class searcher(Process):
    def __init__(self,graph,path,length,from_node,to_node,distance,goal_node):
        Process.__init__(self)
        self.path=path[:]
        self.length=length
        self.from_node=from_node
        self.to_node=to_node
        self.distance=distance
        self.graph=graph
        self.goal_node=goal_node

    def run(self,to_node):
        if DEMO: print "Path so far: %s (length %d). Search from %s to %s" %(self.path,self.length,self.from_node,to_node)
        yield hold,self,self.distance
        if not nodes[to_node].reached:         
            self.path.append(to_node)
            self.length += self.distance
            nodes[to_node].reached = 1
            if to_node==self.goal_node:
                print "SHORTEST PATH",self.path,"Length:",self.length
                stopSimulation()
            else:                  
                for i in self.graph[to_node]:
                    s=searcher(graph=self.graph,path=self.path,length=self.length,from_node=i[0],
                               to_node=i[1],distance=i[2],goal_node=self.goal_node)
                    activate(s,s.run(i[1]))

initialize()
nodes={}
DEMO=1
for i in ("Atown","Btown","Ccity","Dpueblo","Evillage","Fstadt"):
    nodes[i]=node()
""" Format graph definition: a_graph={node_id:[(from,to,distance),(from,to,distance)],node_id:[ . . . ])
"""
net={"Atown":(("Atown","Btown",3.5),("Atown","Ccity",1),("Atown","Atown",9),("Atown","Evillage",0.5)),
     "Btown":(("Btown","Ccity",5),),
     "Ccity":(("Ccity","Ccity",1),("Ccity","Fstadt",9),("Ccity","Dpueblo",3),("Ccity","Atown",3)),
     "Dpueblo":(("Dpueblo","Ccity",2),("Dpueblo","Fstadt",10)),
     "Evillage":(("Evillage","Btown",1),),
     "Fstadt":(("Fstadt","Ccity",3),)}                                                                                                        
if DEMO: print "Search for shortest path from %s to %s \nin graph %s" %("Atown","Fstadt",net)
startup=searcher(graph=net,path=[],length=0,from_node="Atown",to_node="Atown",distance=0,goal_node="Fstadt")
activate(startup,startup.run("Atown"))
simulate(until=10000)    
