I have 2 doubts below, each can be True or False?
a) Dijkstra's Algo will terminate even if there is a -ve edge or -ve cycle.
b) At the termination of Bellman Ford, even if graph has -ve cycle, a correct shortest path is found for a vertex for which shortest path is well-defined.