1 Reply Latest reply on Dec 19, 2007 3:03 AM by 807603

    dijkstra's algorithm for shortest path

    807603
      can it be implemented using just a regular queue or does it have to be a priority queue..... the number of items in my graph is only 12... thank you