grdijkl1.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 40 行

// Dijkstra's algorithm -- v^2 version
#include <stdio.h>
#include <iostream.h>
#include <assert.h>

#include "book.h"

#include "grlist.h"

int minVertex(Graph&, int*);

#include "grdijk1.c"

main(int argc, char** argv) {
  Graph G;
  FILE *fid;
  int i, j;

  if (argc != 2) {
    cout << "Usage: grdijkl1 <file>\n";
    exit(-1);
  }

  if ((fid = fopen(argv[1], "rt")) == NULL) {
    cout << "Unable to open file |" << argv[1] << "|\n";
    exit(-1);
  }

  if (!createGraph(G, fid)) {
    cout << "Unable to create graph\n";
    exit(-1);
  }

  // Initialize Mark array
  for (i=0; i<G.n(); i++)
    G.Mark[i] = UNVISITED;

  Dijkstra(G, 0);
}