One of these can be solved using Djikstras algorithm Single source shortest path All source shortest path Finding cycle in the graph Single source shortest path for negative edges

Algorithm : (1. Single-destination Shortest Path, 2. Bellman-Ford, 3. Negative-Weight Cycles), Dynamic Programming   Define and prove a recurrence for the following problem: Given a directed graph G = (V, E) with edge weight function w : E → R and a source vertex s ∈ V , find a shortest path from s to v for every vertex v ∈ V .

I need an example of a graph where using Floyd's algorithm to find the shortest path doesn't give the right answer because of negative edge weights

Find the cost of a shortest path between a and d in the given weighted graph.