Bellmann Ford Algorithm can be applied for _____________
(a) Undirected and weighted graphs
(b) Undirected and unweighted graphs
(c) Directed and weighted graphs
(d) All directed graphs
I got this question in an interview for job.
I need to ask this question from Shortest Path topic in section Shortest Path of Data Structures & Algorithms II