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

*Instructor:*- Dr. Rani Hod
*Assistants:*- Jad Silbak
- Tal Yankovich

*Term A*: 12/02/2019*Term B*: 15/03/2019

[[div style="direction:rtl; text-align:right"]]

מילים (סוגריים)

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