In q8, I'm trying to understand if I can find an algorithm that has a better complexity than O(|V|*log|V| + |E|) (using only BFS or DFS).

But, if I do, isn't that a contradiction to Dijkstra's algorithm?

ex1 q8

*Instructors:*- Prof. Ron Shamir, Prof. Amos Fiat
*Assistants:*- Ophir Friedler, Tal Yankovich

Spring 2018:

*Term A*: 29/06/2018, 09:00*Term B*: 02/10/2018, 09:00

Fall 2018:

*Term A*: 20/02/2018, 09:00*Term B*: 28/03/2018, 09:00

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License