{"language":[{"iso":"eng"}],"_id":"67351","user_id":"15578","status":"public","title":"Dijkstra - Shortest Path Search mit ganzen Zahlen","year":"2026","author":[{"last_name":"Jones","first_name":"Merlin Frederic ","full_name":"Jones, Merlin Frederic "}],"date_updated":"2026-10-02T11:50:18Z","date_created":"2026-10-02T11:48:03Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"ama":"Jones MF. <i>Dijkstra - Shortest Path Search Mit Ganzen Zahlen</i>.; 2026.","bibtex":"@book{Jones_2026, title={Dijkstra - Shortest Path Search mit ganzen Zahlen}, author={Jones, Merlin Frederic }, year={2026} }","mla":"Jones, Merlin Frederic. <i>Dijkstra - Shortest Path Search Mit Ganzen Zahlen</i>. 2026.","chicago":"Jones, Merlin Frederic . <i>Dijkstra - Shortest Path Search Mit Ganzen Zahlen</i>, 2026.","short":"M.F. Jones, Dijkstra - Shortest Path Search Mit Ganzen Zahlen, 2026.","apa":"Jones, M. F. (2026). <i>Dijkstra - Shortest Path Search mit ganzen Zahlen</i>.","ieee":"M. F. Jones, <i>Dijkstra - Shortest Path Search mit ganzen Zahlen</i>. 2026."}}