engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
Bellman Ford algorithm does not work for graphs _______.
1
that contains positive weight edge
2
that contains negative weight edge
3
that contains negative weight cycle
4
that contains positive weight cycle