hdu3790

转载于 2019-08-21 02:59:17 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/FCWORLD/archive/2011/05/13/2045805.html

文章标签：

#php

本文深入探讨了Dijkstra算法的原理与应用，通过对比正确的算法实现与错误示例，详细解析了算法的关键步骤和常见错误。文章提供了一个完整的Dijkstra算法C++代码示例，帮助读者理解如何在图中寻找最短路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://acm.hdu.edu.cn/showproblem.php?pid=3790

View Code

#include < iostream >
#define M 1001
#define Max 0x7fffffff
using namespace std;

int n,m;
int a,b,d,p;
int s,t;
int map[M][M];
int cost[M][M];
int de[M];
int co[M];
int visit[M];
int len;
int _min;

void Init()
{
int i,j;
for (i = 0 ;i <= n;i ++ )
{
for (j = 0 ;j <= n;j ++ )
{
map[i][j] = Max;
cost[i][j] = Max;
}
}
}

void DJ()
{
int i,j,p,k;

memset(visit , 0 , sizeof (visit));
for (i = 1 ;i <= n;i ++ )
de[i] = co[i] = Max;

de[s] = 0 ;
co[s] = 0 ;

for (i = 1 ;i <= n;i ++ )
{
_min = Max; k = 0 ;

for (j = 1 ;j <= n;j ++ )
{
if ( ! visit[j] && de[j] < _min)
{
_min = de[j];
k = j;
}
}
if (_min == Max) break ;
visit[k] = 1 ;
for ( p = 1 ; p <= n; p ++ )
{
if ( ! visit[p] && map[k][p] != Max)
{
if (de[p] > de[k] + map[k][p])
{
de[p] = de[k] + map[k][p];
co[p] = co[k] + cost[k][p];
}
else if ( de[p] == de[k] + map[k][p] && co[p] > co[k] + cost[k][p] )
{
co[p] = co[k] + cost[k][p];
}
}
}
}
}

int main()
{
while ( cin >> n >> m, n + m )
{
Init();
int i;
for (i = 0 ;i < m;i ++ )
{
cin >> a >> b >> d >> p;

if ( map[a][b] > d)
{
map[a][b] = map[b][a] = d;
cost[a][b] = cost[b][a] = p;
}
}
cin >> s >> t;
DJ();
cout << de[t] << " " << co[t] << endl;
}
return 0 ;
}

wrong answer的代码：帮我看看错哪儿了？哎，有什么特殊例子啊

View Code

#include < iostream >
#define M 1001
#define Max 0x7fffffff
using namespace std;

int n,m;
int a,b,d,p;
int s,t;
int map[M][M];
int cost[M][M];
int visit[M];
int _min;

void Init()
{
int i,j;
for (i = 0 ;i <= n;i ++ )
{
for (j = 0 ;j <= n;j ++ )
{
map[i][j] = Max;
cost[i][j] = Max;
}
}
}

void DJ()
{
int i,j,p,k;

for (i = 1 ;i <= n;i ++ )
{
_min = Max; k = 0 ;

for (j = 1 ;j <= n;j ++ )
{
if ( ! visit[j] && map[ 0 ][j] < _min)
{
_min = map[ 0 ][j];
k = j;
}
}
if (_min == Max) break ;

visit[k] = 1 ;
for ( p = 1 ; p <= n; p ++ )
{
if ( ! visit[p] && map[k][p] != Max)
{
if (map[ 0 ][p] > map[ 0 ][k] + map[k][p])
{
map[ 0 ][p] = map[ 0 ][k] + map[k][p];
cost[ 0 ][p] = cost[ 0 ][k] + cost[k][p];
}
else if ( map[ 0 ][p] = map[ 0 ][k] + map[k][p] && cost[ 0 ][p] > cost[ 0 ][k] + cost[k][p] )
{
cost[ 0 ][p] = cost[ 0 ][k] + cost[k][p];
}
}
}
}
}

int main()
{
while ( cin >> n >> m, n + m )
{
Init();
int i;
for (i = 0 ;i < m;i ++ )
{
cin >> a >> b >> d >> p;

if ( map[a][b] > d)
{
map[a][b] = map[b][a] = d;
cost[a][b] = cost[b][a] = p;
}
}
cin >> s >> t;
map[ 0 ][s] = 0 ;
cost[ 0 ][s] = 0 ;
memset(visit , 0 , sizeof (visit));
DJ();
cout << map[ 0 ][t] << " " << cost[ 0 ][t] << endl;
}
return 0 ;
}

转载于:https://www.cnblogs.com/FCWORLD/archive/2011/05/13/2045805.html