数据结构与算法单源最短路径问题C++求解

void showMatrix();
void shortestPath(int source_point);
void showPath(int * finalDistance,int * finalPath,int source_point);
int main()
{
matrix = NULL;
{
int k;
cout<<"单源最短路径为："<<endl;
for (int i=0;i<num_point;i++)
{
k = i;
cout<<k+1<<"<-";
while (finalPath[k]!=source_point-1 && finalPath[k]!=infinite)
{
cout<<"∞"<<endl;
}
else
{
cout<<finalDistance[i]<<endl;
}
}
}
void showMatrix()//显示矩阵
{
finalDistance[i] = finalDistance[prime] + matrix[prime][i];
finalPath[i] = prime;
}
}
int max = infinite;
int prime = source_point-1;
int progress = 0;
while (progress < num_point-1)
{
max = infinite;
for (int i=0;i<num_point;i++)
}
else if (choice == 3)
{
exit(0);
}
}
void shortestPath(int source_point)//求单源最短路
{
int *s = new int[num_point];//记录哪些点的最短路径已经确定
}
return 0;
}
void menu()//菜单栏
{
cout<<"********************"<<endl;
cout<<"1.建立有向网"<<endl;
cout<<"2.求单元最短路径"<<endl;
cout<<"3.退出"<<endl;
}
s[prime] = 1;
for (int i=0;i<num_point;i++)
{
if (finalDistance[i]>finalDistance[prime] + matrix[prime][i])
#include <iostream>
#include <string>
using namespace std;
const int infinite = 16843009;
int ** matrix;
int num_point;
void menu();
void function(int choice);
{
if (finalDistance[i]<max && s[i] == 0)
{
max = finalDistance[i];
prime = i;
}
int * finalDistance = new int[num_point];//记录从源点到其他各点的最短长度
int * finalPath = new int[num_point];//记录最短长度对应的路径
memset(s,0,num_point*sizeof(int));//初始话s数组
cout<<"以(0,0,0)结束输入"<<endl;
for (int i=0;i<3;i++)
{
cin>>info[i];
}
while (info[0]!=0)
{
matrix[info[0]-1][info[1]-1] = info[2];
}
else
{
cout<<matrix[i][j]<<"\t";
}
}
cout<<endl;
}
}
for (int i=0;i<3;i++)
{
cin>>info[i];
}
}
cout<<"有向网建立成功:"<<endl;
showMatrix();
{
finalPath[i] = source_point-1;
}
else
{
finalPath[i] = infinite;
}
}
s[source_point-1] = 1;//源点到源点的最短距离已经确定
memset(matrix[i],1,num_point*sizeof(int));//赋初值为无穷大:16843009;
matrix[i][i] = 0;
}
cout<<"请按照三元组的形式输入各点信息（起点，终点，权值）"<<endl;
{
cout<<finalPath[k]+1<<"<-";
k = finalPath[k];
}
cout<<source_point<<" ";
if (finalDistance[i]==infinite)
for (int i=0;i<num_point;i++)
{
finalDistance[i] = matrix[source_point-1][i];//初始化finalDistance数组
if (finalDistance[i]<infinite)
num_point = 0;
menu();
int choice;
cin>>choice;
while (choice!=0)
{
function(choice);
பைடு நூலகம் menu();
cin>>choice;
cout<<"********************"<<endl;
}
void function(int choice)//功能函数
{
if (choice==1)
{
int info[3];
cout<<"请输入顶点的个数："<<endl;
}
else if (choice == 2)
{
int source_point;
cout<<"请输入您所选定的源点："<<endl;
cin>>source_point;
shortestPath(source_point);
cin>>num_point;
matrix = new int*[num_point];
for (int i=0;i<num_point;i++)
{
matrix[i] = new int[num_point];
{
for (int i=0;i<num_point;i++)
{
for (int j=0;j<num_point;j++)
{
if (matrix[i][j]==infinite)
{
cout<<"∞"<<"\t";
progress++;
}
//cout<<"ff"<<endl;
showPath(finalDistance,finalPath,source_point);
}
void showPath(int * finalDistance,int * finalPath,int source_point)//输出单源最短路径