CS312Graph.py

#!/usr/bin/python3


class CS312GraphEdge:
    def __init__( self, src_node, dest_node, edge_length ):
        self.src   = src_node
        self.dest  = dest_node
        self.length= edge_length

    def __repr__( self ):
        return self.__str__()

    def __str__( self ):
        return '(src={} dest={} length={})'.format(self.src,self.dest,self.length)

class CS312GraphNode:
    def __init__( self, node_id, node_loc ):
        self.node_id   = node_id
        self.loc       = node_loc
        self.neighbors = [] #node_neighbors
        self.distance = float("inf")
        self.prev = None
        self.queue_index = None

    def getQueueIndex(self):
        return self.queue_index

    def setQueueIndex(self,index):
        self.queue_index = index
    def addEdge( self, neighborNode, weight ):
        self.neighbors.append( CS312GraphEdge(self,neighborNode,weight) )

    def changeDistance(self, distance):
        if self.distance == float("inf") or distance == float("inf"):
            self.distance = distance
        else:
            self.distance += distance

    def getId(self):
        return self.node_id

    def getDistance(self):
        return self.distance

    def getPrev(self):
        return self.prev

    def changePrev(self,neighbor):
        self.prev = neighbor

    def __str__( self ):
        neighbors = [edge.dest.node_id for edge in self.neighbors]
        return 'Node(id:{},neighbors:{})'.format(self.node_id,neighbors)


class CS312Graph:
    def __init__( self, nodeList, edgeList ):
        self.nodes    = []
        self.edges = edgeList
        for i in range(len(nodeList)):
            self.nodes.append( CS312GraphNode( i, nodeList[i] ) )

        for i in range(len(nodeList)):
            neighbors = edgeList[i]
            for n in neighbors:
                self.nodes[i].addEdge( self.nodes[n[0]], n[1] )
        
    def __str__( self ):
        s = []
        for n in self.nodes:
            s.append(n.neighbors)
        return str(s)

    def getNodes( self ):
        return self.nodes

    def getEdges(self):
        return self.edges