"dijkstra_output.txt">dijkstra_output.txt</a>,
          the output file.
        </li>
      </ul>
    </p>

    <h3 align = "center">
      List of Routines:
    </h3>

    <p>
      <ul>
        <li>
          <b>MAIN</b> runs an example of Dijkstra's minimum distance algorithm.
        </li>
        <li>
          <b>DIJKSTRA_DISTANCE</b> uses Dijkstra's minimum distance algorithm.
        </li>
        <li>
          <b>FIND_NEAREST</b> finds the nearest unconnected node.
        </li>
        <li>
   