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
- Alon Eden

*Exam*: 10/07/2017, 14:00*Moed B*: 01/10/2017

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