{

explicit Vertex(const char id)

: id(id), neighbors(std::set<Vertex*>()), predecessor(nullptr), distance(std::numeric_limits<int>::max())

{

}

char id;

std::set<Vertex*> neighbors;

Vertex* predecessor;

int distance;

{

public:

void AddVertex(Vertex& v);

void AddEdge(Vertex& u, Vertex& v, int weight);

/**

void BellmanFordAlgorithm(Vertex& source);

std::vector<Vertex*> vertices;

std::vector<std::tuple<Vertex*, Vertex*>> adjacency_list;

std::map<std::pair<char, char>, int> weight_list;