deal.h

来自「数据库课程设计 导航 其实就是Dijkstra算法的应用」· C头文件 代码 · 共 43 行

#include "shortPaht.h"

void checkUnit(LHList<Unit *> &message)//查看某一点的信息
{
  char unit;
  cout<<"input unit symbol"<<endl; 
  cin>>unit; 
  if(unit>96)
    unit=unit-32;
  message.printNode(unit);
  cout<<endl<<endl
	  <<"===================================继续==============================="
	  <<endl;
  message.printList();
  cout<<"Check Unit message input M"
	   <<"\tCheck path input P"
	   <<"\tExit input Q"
	   <<endl;
}

void deal(LHList<Unit *> &message,int **points,int rowNumber)
{
   char command;
   message.printList();
   cout<<"Check Unit message input M"
	   <<"\tCheck path input P"
	   <<"\tExit input Q"
	   <<endl;
   do
   {
      cin>>command;
      switch(command)
	  {
	   case 'm':
       case 'M':checkUnit(message); break;
	   case 'p':
       case 'P':checkPath(message,points,rowNumber);break;
	   case 'q':
	   case 'Q':return ;break;
       default: cout<<"命令错误!重新输入"<<endl;
	  }
   }while(command!='Q');
}