title: Can we apply the Bellman-Ford algorithm to an Undirected Graph?
body: <p>I know that Bellman-Ford Algorithm works for directed graphs. Will it will work for an undirected graph? It seems that with an undirected graph, it will not be able to detect cycles because parallel edges will be considered cycles. Is this true or not? Can the algorithm be applied?</p>