2nd semester application programming Bahninfo.cpp
Find the shortest path from one subway station to another. We get a textfile with all the stations in sorted in the following way.
linename:station_1;...;station_n
We read the file, build up a neighborhoodlist and searched it with the Breath First Search algorithm. It was a more simple case because we set the distance between two stations hard to 1.
No Comments
No comments yet.
RSS feed for comments on this post. TrackBack URL