Graph, unweighted, directed/undirected -> bfs
(Bfs would work in all graphs which aint weighted)
Graph, weighted, directed/ undirected -> dijkstra's
(all weighted graphs except negative weights)
Graph , negative weighted , directed/ undirected -> Bellman ford
(- weight)
2/3