please tell for each shortest path algorithm,in which types of graphs they can be used i.e. undirected or directed,weighted or unweighted,negative edges or non-negative edges.
tell for sssp using bfs,djikstra ,bellman ford,floyd warshall?
Types of graphs issue
@Rj.25
This means you are not thorough with the algorithms.
but still you asked about it so I have to answer it. I strongly suggest manually thinking about every algorithm yourself whether it will work or not.
SSSP using BFS : unweighted undirected graph.
Dijsktra : directed/undirected, weighted graph, non negative edges.
bellmanford : weighted directed graph, can contain negative edges.
floyd warshall : directed weighted graph, can contain negative edges.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.