yes, I think you will need a link list of linked lists - that is, a link lists which each of its elements is a linked list.
yes, I think you will need a link list of linked lists - that is, a link lists which each of its elements is a linked list.
==========================signature=============== ==================
S.O.L.I.D principles (use them!):
https://en.wikipedia.org/wiki/SOLID_...iented_design)
Do you write clean code? - if you are TDD'ing then maybe, if not, your not writing clean code.
Hi, can somebody give me an idea, how to make recursive search of 2 stations (starting one + ending one) ?
This is a railway(look at the picture) where you enter a station and get off on another station. Now I have to make recursive search how to find the shorthest path between these two stations.
Thanks
Use Dijkstra's algorithm, although the implementation might be a bit tricky with such non-standard representation of a graph.
in case each station is connected to not more then two other stations, you could use a binary search tree, which is easy.
==========================signature=============== ==================
S.O.L.I.D principles (use them!):
https://en.wikipedia.org/wiki/SOLID_...iented_design)
Do you write clean code? - if you are TDD'ing then maybe, if not, your not writing clean code.
Bookmarks