Code posted below. Basically, a friend and I are working on a C++ project where we’re taking a graph.txt file as an input, and it’s supposed to run Dijkstra’s Shortest Path Algorithm and output the adjacency matrix with the distances from each vertex. We’re given test .txt files, but no matter what I try to do to fix my matrix code, it doesn’t output the correct one. I think there’s some infinite loop going on, but I can’t find where.