c++ - Create a routing table for Dijkstra's algorithm using min_heap for node selection -
i need implement min_heap node selection routing table that's using dijkstra's algorithm. information obtained input file, 'text1.txt', formatted 10 // number of nodes = 10 (labelled 0, 1, 2, …., 9) 25 //number of directed edges = 25; next 25 lines define edges 1 3 7 //there edge v1 v3 cost of 7 5 2 1 //there edge v5 v2 cost of 1 6 4 5 //there edge v6 v4 cost of 5 here code far: #include <iostream> #include <vector> #include <fstream> using namespace std; class e_node { //stands edge node public: int nb;//the neighbor of considered node int weight; //weight of edge above neighbor e_node() {}//constructor }; class rt_node { //rt stands routing table public: int cost; //cost node int from; //the node node int checked; int h_pos; //the postion in heap node rt_node() { = -1; cost = 9999; checked = 0; } }; class h_node { //stands head_node public: int id; int cost; h_node() { id = -1; cost = 9999; } h_node(int i, int j) { id = i; cost =...
