Answer Happy

Posted: **Fri Apr 29, 2022 6:47 am**

: Which Of The Following Properties Of A Weighted Graph G Will Prevent The Use Of Dijkstra S Algorithm For Finding Shortes 1 (11.56 KiB) Viewed 22 times

Which of the following properties of a weighted graph G will prevent the use of Dijkstra's algorithm for finding shortest paths in G? G has undirected edges. O G has cycles. OG is connected G has some negative weight edges.