C++实现景区信息管理系统

#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#define MAX 20 
#define MAX2 2 
#define INFINITY 32767 
int arr1[MAX][MAX]; 
 
using namespace std; 
double arr[MAX][MAX]; 
 
class ArcNode { 
 public: 
 int adjvex; 
 ArcNode *nextarc; 
 double weight; 
}; 
 
 
class VNode { 
 public: 
 string data1; 
 string data2; 
 int wel; 
 bool wc; 
 bool rest; 
 ArcNode *firstarc; 
}; 
 
class ALGraph { 
 public: 
 VNode *vertices; 
 int vexnum, arcnum; 
 ArcNode *arcNode; 
}; 
 
class zanlind 
{ 
public: 
 int number; 
 int hour; 
 int minute; 
}; 
 
 
int LocateVex(ALGraph G, string v) { 
 int i; 
 for(i = 0; v != G.vertices[i].data1 && i < G.vexnum; i++) 
 ; 
 if(i >= G.vexnum) 
 return -1; 
 return i; 
} 
 
int LocateW(ALGraph G, int wel) { 
 int i; 
 for(i = 0; wel != G.vertices[i].wel && i < G.vexnum; i++) 
 ; 
 if(i >= G.vexnum) 
 return -1; 
 return i; 
} 
 
void CreateUDN(ALGraph &G) { 
 G.arcNode=new ArcNode[MAX]; 
 G.vertices=new VNode[MAX]; 
 
 fstream file("info.txt"); 
 if(file.fail()) 
 { 
 cout << "error open!" << endl; 
 } 
 int j; 
 ArcNode *s, *t; 
 cout<<"请输入顶点数和边数："; 
 cin>>G.vexnum>>G.arcnum; 
 int i=0; 
 cout<>G.vertices[i].data1>>G.vertices[i].data2 >> 
 G.vertices[i].wel>> G.vertices[i].rest>>G.vertices[i].wc; 
 G.vertices[i].firstarc = NULL; 
 i++; 
 } 
 cout<>v1>>v2>>weight; 
  
 int i = LocateVex(G, v1); 
 int j = LocateVex(G, v2); 
 
 s = new ArcNode(); 
 t = new ArcNode(); 
 
 s->adjvex = j; 
 s->nextarc = G.vertices[i].firstarc; 
 s->weight=weight; 
 G.vertices[i].firstarc =s; 
 
 t->adjvex = i; 
 t->nextarc = G.vertices[j].firstarc; 
 t->weight=weight; 
 G.vertices[j].firstarc =t; 
 } 
 file1.close(); 
 file.close(); 
 
} 
 
 
void PrintAdjList(ALGraph &G) { 
 cout<<"下面是图的邻接链表输出：" <nextarc) 
  cout<<"--------->"<adjvex; 
 cout<adjvex]=p->weight; 
  p=p->nextarc; 
  } 
 
 } 
 } 
 cout<<" "; 
 for(int n1=0; n1 *s=new stack(); 
 
bool isOver(ALGraph G,bool a[MAX]) { 
 for(int i=0; istatus; 
 int n=0; 
 int num = -1; 
 int pk; 
 ArcNode *e; 
 cout << G.vertices[0].data1 << "->"; 
 sta[0] =false; 
 status.push(0); 
 int aa, bb; 
 aa = 0; 
 
 while (n < G.vexnum-1){ 
  e = NULL; 
  num = status.top(); 
  e = G.vertices[num].firstarc; 
  while (e){ 
  if (sta[e->adjvex] == false){ 
   e = e->nextarc; 
  } 
  else{ 
   status.push(e->adjvex); 
   cout << G.vertices[e->adjvex].data1<<"->"; 
   aa = e->adjvex; 
   sta[e->adjvex] = false; 
   n++; 
   break; 
  } 
   } 
  if (e == NULL){ 
  pk = status.top(); 
  bb = pk; 
  if (aa != bb){ 
   cout << G.vertices[pk].data1<<"->"; 
  } 
  
  status.pop(); 
  } 
  if (status.top() == 0){ 
  cout << G.vertices[0].data1 << "->"; 
  } 
 } 
 cout << endl; 
} 
 
bool IsEdge(ALGraph G) { 
 string s1, s2; 
 cin>>s1>>s2; 
 int iA=LocateVex(G,s1); 
 int jA=LocateVex(G,s2); 
 
 ArcNode *p=G.vertices[iA].firstarc; 
 while(p) { 
 if(p->adjvex==jA) { 
  return 1; 
 } else { 
  p=p->nextarc; 
 } 
 } 
 return 0; 
 
 
} 
 
int adjlist[MAX]; 
void FindInDegree( ALGraph &g) { 
 int i; 
 ArcNode *p; 
 for (i=0; iadjvex]++; 
  p=p->nextarc; 
 } 
 } 
} 
void JudgeCir(ALGraph G) { 
 FindInDegree(G); 
 int count=0; 
 int Q[MAX]; 
 int front,rear,v; 
 front=rear=-1; 
 for(int i=0; i0 && arr[v][j]<32767) { 
   adjlist[j]--; 
   if(adjlist[j]==1) { 
   Q[++rear]=j; 
   count++; 
   } 
  } 
  } 
 } else { 
  adjlist[v]=-1; 
 } 
 } 
 
 if(counti; j--) { 
  if(tmp < ary[j]) { 
  ary[i] = ary[j]; 
  ary[j] = tmp; 
  tmp = ary[i]; 
  } 
 } 
 } 
 
 for(int j=0; ji; j--) { 
  if(tmp <= ary[j]) { 
  a[i]=j; 
  ary[i] = ary[j]; 
  a[i]=j; 
  ary[j] = tmp; 
  tmp = ary[i]; 
  } 
  
  
 } 
 } 
 
 for(int j=0;j>s1>>s2; 
 if(isInVe(G,s1) && isInVe(G,s2)) 
 { 
 iA=LocateVex(G,s1); 
 jA=LocateVex(G,s2); 
 ShortestPath_DIJ(G,iA, p, D); 
 cout<<"到各顶点的最短路径及长度为："<-1) 
   cout< parking; 
stack cars; 
queue waits; 
int z[MAX2]; 
bool isInZan(int zan[],int number) 
{ 
 for(int i=0;i>zan.number; 
 cout<tm_hour;//得到当前时间的小时 
 int m = newtime->tm_min;//得到当前时间的分钟 
 zan.hour=h; 
 zan.minute=m; 
 
 
 cout<<"进场时间为："; 
 if(zan.minute>=1 && zan.minute<10) 
 { 
 cout<>number; 
 if(isInZan(z,number)) 
 { 
  while(parking.top().number!=number) 
  { 
  cars.push(parking.top()); 
  parking.pop(); 
  } 
  
  int num=indexZ(z,parking.top().number); 
  z[num]=0; 
  /* 
  time_t t = time(0); 
  char tmp[64]; 
  strftime(tmp,sizeof(tmp),"%X ",localtime(&t)); 
  */ 
  struct tm *newtime; 
  time_t long_time; 
  time( &long_time ); //Get time as long integer 
  newtime = localtime( &long_time ); 
  int h = newtime->tm_hour;//得到当前时间的小时 
  int m = newtime->tm_min;//得到当前时间的分钟 
  cout<<"车牌号为："<:"; 
 char choose; 
 cin>>choose; 
 if(choose=='A' || choose=='D' || choose=='E') 
 { 
  switch(choose) 
  { 
  case 'A': 
   goIn(); 
   goto r2; 
  case 'D': 
   goOut(); 
   goto r2; 
  case 'E': 
   break; 
  } 
 } 
 else 
 { 
  cout<<"您的输入有误，请输入  其中的一项。"; 
  goto r2; 
 } 
} 
 
int main() { 
 int i, j; 
 int iAA; 
 ALGraph *G=new ALGraph(); 
 int choose=0; 
 cout<>choose; 
  
 if(choose<=8 && choose>=0) { 
  if(choose>1 && G->vexnum==0 &&choose!=8) { 
  cout<>ch; 
   string sA; 
   switch(ch) 
   { 
    case 0: 
    cout<<"请输入您要查找的有关景点的关键字：" ; 
    cin>>sA; 
    Search(*G,sA); 
    break; 
    case 1: 
    SortWel(*G); 
    break; 
    case 2: 
    SortN(*G); 
    break; 
    case 3: 
    goto r; 
    default : 
    cout<<"您的输入有误，请重新输入："<