desc.json

{
  "Bellman-Ford": "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is different from Dijkstra's Shortest Path Algorithm because it allows NEGATIVE weights unlike Dijkstra's.",
  "Applications": [
    "Packet Routing - A variation of BF is used in the Distance vector Routing Protocol"
  ],
  "Complexity": {
    "time": "worst $O(|V|\\cdot |E|)$",
    "space": "worst $O(|V|)$"
  },
  "References": [
    "<a href='https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm'>Wikipedia</a>"
  ],
  "files": {
    "shortest_path": "Finding the shortest path"
  }
}