Bellman–Ford Algorithm

#include <iostream>
#include "directed_graph.h"

using namespace std;

int main() {

    auto graph = new Graph();
    graph->add_node("A");
    graph->add_node("B");
    graph->add_node("C");
    graph->add_node("D");
    graph->add_node("E");

    graph->add_edge("A", "B", -1);
    graph->add_edge("A", "C", 4);
    graph->add_edge("B", "C", 3);
    graph->add_edge("B", "D", 2);
    graph->add_edge("B", "E", 2);
    graph->add_edge("D", "C", 5);
    graph->add_edge("D", "B", 1);
    graph->add_edge("E", "D", -3);

    std::vector<std::vector<std::string>> vec;
    cout << graph->bellman_ford("A",vec) << endl;
    
    for (auto const &x : vec) {
       cout << x[0] << " - " << x[1] << endl;
    }

    graph->print();

    delete graph;

    return 0;
}

0
0 - 0
1 - -1
2 - 2
3 - -2
4 - 1
0: 
	weight: -1 to: 1
	weight: 4 to: 2
1: 
	weight: 3 to: 2
	weight: 2 to: 3
	weight: 2 to: 4
2: 
3: 
	weight: 5 to: 2
	weight: 1 to: 1
4: 
	weight: -3 to: 3

Process finished with exit code 0