Vidyalelo
Data Structure · Q153

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 153

Q153

Bellmann Ford Algorithm can be applied for . . . . . . . .

A.
Undirected and weighted graphs
B.
Undirected and unweighted graphs
C.
Directed and weighted graphs
Answer
D.
All directed graphs

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board