数据结构校园导游

cin>>s;
if(s)
{
cout<<"输入编号"<<" "<<"输入名字"<<" "<<"简介"<<endl;
cin>>b>>name1>>intr;
n=n+1;
MGr.vexs[n].num=n;
strcpy(MGr.vexs[n],name1);
}
for(i=1;i<=n;i++)
{
MGr.edges[i][i]=0;}
input1.close();
input2.close();
}
/*void CreatGraph()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
}
void quanlu()
{ifstream ReadFile("m_file1.txt");
//system("cls");
char k;
while(!ReadFile.eof())
{ReadFile.get(k);
cout<<k;
}
cout<<endl;
ReadFile.close();
{
MGr.edges[i][j]=MAXCOST;//MAXCOST是路径无穷大
}
}
for(i=1;i<=n;i++)
{
shortest[i][i]=0;
}
} */
void zengjia()
{ofstream output1("m_file1.txt",ios::app);
}
} /*初始化数组*/
for(k=1;k<=n;k++)//k为经过的点
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(shortest[i][j]>(shortest[i][k]+shortest[k][j]))
typedef struct
{
int num; /*顶点编号*/
Elemtype date; /*顶点信息*/
}Vertex; /*定义顶点*/
typedef struct
{
Vertex vexs[MaxVertexNum]; /*存放顶点的一维数组,数组第零个单元没有用上*/
strcpy(MGr.vexs[n].date.number,b);
strcpy(MGr.vexs[n].date.introduce,intr);
output1<<b<<" "<<name1<<" "<<intr<<" "<<endl;
cout<<"它与几个点联通？"<<endl;
unsigned int edges[MaxVertexNum][MaxVertexNum]; /*存放路径的长度*/
}MGraph;
MGraph MGr; /*全局变量,定义MGr为MGraph类型*/
int shortest[MaxVertexNum][MaxVertexNum]; /*定义全局变量存贮最小路径*/
{
cout<<"输入一个与它有路径的景点名："<<endl;
cin>>name2;
r=1;
while(strcmp(MGr.vexs[r],name2)!=0)
r++;
cout<<"输入这两个景点间的距离"<<endl;
cin>>w;
#include <iostream>
#include <string>
#include<fstream>
#include <iomanip>
using namespace std;
#define MaxVertexNum 50 /*景点个数最大50*/
#define MAXCOST 10000000 /*定义路径的无穷大*/
system("cls");cout<<"我们学校的景点:"<<endl;
for(i=1;i<=n;i++)
if(MGr.vexs[i].num!=0)
cout<<MGr.vexs[i]<<" ";
}
void introduce()
{int r=1;
char name[60];
cout<<"请输入查询景点名"<<endl;
cin>>name;
while(strcmp(MGr.vexs[r],name)!=0)
r++;
if(MGr.vexs[r].num!=0)
int path[MaxVertexNum][MaxVertexNum]; /*定义存贮路径*/
int n=10,w;
//ofstream output2("m_file2.txt");
void MyFread()
{
fstream input1("m_file1.txt");
{
shortest[i][j]=shortest[i][k]+shortest[k][j];
path[i][j]=k;
path[j][i]=k;/*记录经过的路径*/
}//end_if
}
int u,v,w;
int k=1;
while(input2>>u>>v>>w){
//cout<<u<<" "<<v<<" "<<w<<endl;
MGr.edges[u][v]=MGr.edges[v][u]=w;
//MGr.edges[k][k]=0;
k++;
MGr.edges[n][n]=0;
fstream input2("m_file2.txt");
int u,v,w;
int k=1;
while(input2>>u>>v>>w){
//cout<<u<<" "<<v<<" "<<w<<endl;
MGr.edges[u][v]=MGr.edges[v][u]=w;
shortest[n][n]=0;
//ofstream output1("m_file1.txt");
//ofstream output2("m_file2.txt");
//output1<<b<<' '<<name1<<' '<<intr<<endl;
for(f=1;f<=e;f++)
}
void floyd()//弗洛伊德算法 找出最短路径
{
int i,j,k;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
shortest[i][j]=MGr.edges[i][j];
path[i][j]=0;
//MGr.edges[k][k]=0;
k++;
}
for(i=1;i<=n;i++)
{
MGr.edges[i][i]=0;}
}
//output1.close();
//output2.close();
}
}
void displayall()
{int i;
#define T 10 /*目前景点个数*/
typedef struct
{
char name[20]; /*景点名称*/
char number[15]; /*景点代号*/
char introduce[100]; /*景点简介*/
}Elemtype;
MGr.edges[r][n]=MGr.edges[n][r]=w;
//shortest[r][n]=shortest[n][r]=w;
//output2<<b<<" "<<r<<" "<<MGr.edges[r][n]<<endl;