#include

#include

#include

#include

#include

#include

#include

#include

using namespace std;

class Graph $\{$

private:

int nodeCount;

vector$>>$ adjacencyList;

vector prevNode;

public:

Graph$($int nodeCount$)$;

void insertEdge$($int start, int end, int weight$)$;

vector runDijkstra$($int source$)$;

void printDistances$($const vector& distances$)$;

$\}$;

Graph::Graph$($int nodeCount$)\{$

this$->$nodeCount $=$ nodeCount;

adjacencyList.resize$($nodeCount$)$;

prevNode.resize$($nodeCount$,-1)$;

$\}$

void Graph::insertEdge$($int start, int end, int weight$)\{$

adjacencyList$[$start$].$emplace$\_$back$($end$,$ weight$)$;

adjacencyList$[$end$].$emplace$\_$back$($start$,$ weight$)$; $//$ Assuming undirected graph

$\}$

vector Graph::runDijkstra$($int source$)\{$

vector distance$($nodeCount$,$ INT$\_$MAX$)$;

priority$\_$queue, vector$>,$ greater$>>$ pq;

distance$[$source$]=0$;

pq$.$emplace$(0,$ source$)$;

while $(!$pq$.$empty$())\{$

int currentNode $=$ pq$.$top$().$second;

int currentDistance $=$ pq$.$top$().$first;

pq$.$pop$()$;

for $($const auto& neighbor : adjacencyList$[$currentNode$])\{$

int nextNode $=$ neighbor.first;

int edgeWeight $=$ neighbor.second;

if $($distance$[$nextNode$]>$ currentDistance $+$ edgeWeight$)\{$

distance$[$nextNode$]=$ currentDistance $+$ edgeWeight;

prevNode$[$nextNode$]=$ currentNode;

pq$.$emplace$($distance$[$nextNode$],$ nextNode$)$;

$\}$

$\}$

$\}$

return distance;

$\}$

void Graph::printDistances$($const vector& distances$)\{$

for $($int dist : distances$)\{$

if $($dist $==$ INT$\_$MAX$)\{$

cout $<<$ "INF";

$\}$ else $\{$

cout $<<$ setw$(3)<<$ right $<<$ dist;

$\}$

cout $<<""$; $//$ Three spaces between each number

$\}$

cout $<<$ endl;

$\}$

int main$()\{$

ifstream inputFile$("$input$1.$txt$")$;

if $(!$inputFile.is$\_$open$())\{$

cerr $<<$ "Error opening file." $<<$ endl;

return $1$;

$\}$

int nodeCount;

inputFile $>>$ nodeCount;

Graph graph$($nodeCount$)$;

int startNode, endNode, edgeWeight;

while $($inputFile $>>$ startNode $>>$ endNode $>>$ edgeWeight$)\{$

graph.insertEdge$($startNode$,$ endNode, edgeWeight$)$;

$\}$

inputFile.close$()$;

ofstream outputFile$1("$output$1.$txt$")$;

ofstream outputFile$2("$output$2.$txt$")$;

ofstream outputFile$3("$output$3.$txt$")$;

if $(!$outputFile$1.$is$\_$open$()||!$outputFile$2.$is$\_$open$()||!$outputFile$3.$is$\_$open$())\{$

cerr $<<$ "Error opening output files." $<<$ endl;

return $1$;

$\}$

for $($int i $=0$; i $<$ nodeCount; $++$i$)\{$

vector distances $=$ graph.runDijkstra$($i$)$;

graph.printDistances$($distances$)$;

$\}$

outputFile$1.$close$()$;

outputFile$2.$close$()$;

outputFile$3.$close$()$;

return $0$;

$\}$ with this code im getting this output:

$04121921119814$

$408152212121110$

$12807144672$

$19157091113149$

$2122149010121316$

$1112411100236$

$912613122016$

$811714133107$

$141029166670$ when the formatting should be as such:$04121921119814$

$408152212121110$

$12807144672$

$19157091113149$

$2122149010121316$

$1112411100236$

$912613122016$

$811714133107$

$141029166670$