/*                                                                     mainalg.c
    The nice algorithm for shortest route
                                                                              */

#include "utilities.h"
#include "data.h"
#include "algorithmic.h"

void main(void)
{ int n;
  city_record *a, *b;
  read_data();
//  print_data();    // just used to check all read correctly

  printf("\nStarting place: ");
  a=read_city(stdin);
  printf("Destination: ");
  b=read_city(stdin);

  use_basic_graph_algorithm(a,b);
  print_all_algorithmic_distances(b);   // just for information
  dos_pause();
  print_algorithmic_route(a,b);

  dos_pause(); }