Routing-competition

This notebook is part of a coding challenge sponsored by get-in-IT and Bertrandt. The task is as follows:

"Dein Ziel ist der Planet b3-r7-r4nd7. Es gilt den schnellsten Weg von dem Knotenpunkt "Erde" aus zu finden. Dabei kannst Du nur von Himmelskörper zu Himmelskörper reisen. Alle Wegstrecken und Planeten findest Du in dem JSON-File. Dabei kannst Du Dich von Graph.nodes[Graph.edges[i].source] nach Graph.nodes[Graph.edges[i].target] und umgekehrt bewegen (ungerichteter Graph). Die Graph.edges[i].cost geben die Entfernung zwischen den beiden Planeten an."

The target is to reach planet b3-r7-r4nd7. You have to find the fastest way from planet earth. We can jump from planet to planet. All paths and planets are located in the json file. We can move from Graph.nodes[Graph.edges[i].source] to Graph.nodes[Graph.edges[i].target] and vice versa (undirected ghraph). Graph.edges[i].cost are showing the cost between both planets.

https://www.get-in-it.de/coding-challenge?utm_source=magazin&utm_medium=advertorial&utm_campaign=coding-challenge

Lets switch to the commando bridge of the space explorer space carrier to see how we can reach b3-r7-r4nd7.

Please open "The way to b3-r7-r4nd7.ipynb"

Update: There seems to be (sometimes) a problem with the rendering of the ipynb file, please open the notebook here:

https://nbviewer.jupyter.org/github/arnimpdm/Routing-competition/blob/master/The%20way%20to%20b3-r7-r4nd7.ipynb?flush_cache=true