944,017 Members | Top Members by Rank

Ad:
  • C++ Discussion Thread
  • Unsolved
  • Views: 2235
  • C++ RSS
Sep 17th, 2007
0

problem implementing BFS using string vector

Expand Post »
Hi All,

The problem is that i have to read in a text file which is something like:

ASt BSt
BSt WSt
BSt YeSt
BSt KrSt
MSt KrSt

they are possible street intersections from ASt to MSt. I have to output the list of streets in order to reach MSt from ASt like:

ASt
BSt
KrSt
MSt

This is to be done using Breadth First Search.

The problem i am facing is that, i have stored the intersections in a string vector, but i am not able to compare two string vector elements.

Can anyone kindly help me out here. I already tried the == and compare function.
Similar Threads
Reputation Points: 10
Solved Threads: 0
Newbie Poster
CrazyCoder is offline Offline
1 posts
since Sep 2007

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Message:
Previous Thread in C++ Forum Timeline: Need help making a program
Next Thread in C++ Forum Timeline: g++ and int main





About Us | Contact Us | Advertise | Acceptable Use Policy
Forum Index | Build Custom RSS Feed


Follow us on Twitter


© 2011 DaniWeb® LLC