14
Sandeep Shelke
Last seen 5 years ago
Member for 10 years, 7 months, 14 days
Difficulty Normal
Python, C++ programmer. Blogger. Political activist.
Liked
a comment created by Amachua
for
forum post "How to solve Disposable-Teleporters"
You can solve that task with the Dijkstra, A* algorithm. Take a look at it :)
Commented a forum post "How to solve Disposable-Teleporters" created by
SandeepShelke
@Amachua
Thank you for tips. @bryukh's example helped a lot. And not the code is published. :)
Liked
a comment created by bryukh
for
forum post "How to solve Disposable-Teleporters"
For me easy to explain it with a code.
The simple realization of DFS (or BFS)
def checkio(gr
Commented a forum post "How to solve Disposable-Teleporters" created by
SandeepShelke
@bryukh
Thanks for your tips here. It was very helpful. It took a lot of time to understand the sta
Commented a forum post "How to solve Disposable-Teleporters" created by
SandeepShelke
Amachua,
Dijkstra, A* - this is something I avoided all my college days. But alas destiny needs me
