Q. Which algorithm is used to find the shortest path in a graph with negative weights?

नकारात्मक भार वाले ग्राफ़ में सबसे छोटा पथ खोजने के लिए किस एल्गोरिदम का उपयोग किया जाता है?

A
DFS
B
Dijkstra’s Algorithm
C
Bellman-Ford Algorithm
D
BFS

Explanation

Explanation will be available soon. Please stay tuned.

व्याख्या जल्द ही उपलब्ध होगी। कृपया बने रहें।

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

Comments

Leave a Comment