Thread: breath first search shortest path

  1. #1
    Registered User
    Join Date
    Apr 2010

    breath first search shortest path

    when i perform a BFS on a graph until i find the required node and print the predesessor vector i don't get nodes that are on the shortest path. i get nodes that are not on the shortest path as well

    How can i resolve this issue?

    Please help.

  2. #2
    Just a pushpin. bernt's Avatar
    Join Date
    May 2009
    Use the boost c++ library.
    Or, alternately, post your code so we can see what you're doing wrong.
    We haven't written an ESP program (yet), so reading your mind is out of the question. Sorry.
    Consider this post signed

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. changing the gcc standard include search path
    By RoshanX in forum Linux Programming
    Replies: 1
    Last Post: 01-01-2007, 09:23 AM
  2. Path Finding Using Adjacency List.
    By DeepBlackMagic in forum C++ Programming
    Replies: 7
    Last Post: 05-16-2005, 02:34 PM
  3. Search Engine - Binary Search Tree
    By Gecko2099 in forum C Programming
    Replies: 9
    Last Post: 04-17-2005, 02:56 PM
  4. Firefox and Google Search
    By DeepFyre in forum Tech Board
    Replies: 0
    Last Post: 01-16-2005, 10:28 AM
  5. Simple search program
    By colinuk in forum C Programming
    Replies: 6
    Last Post: 12-18-2004, 01:58 AM