hdu1124(djstra+dfs)

最新推荐文章于 2018-10-07 13:59:20 发布

The Dark Kinght

最新推荐文章于 2018-10-07 13:59:20 发布

阅读量584

点赞数

CC 4.0 BY-SA版权

分类专栏： dfs 图论

本文链接：https://blog.csdn.net/u013455430/article/details/21887717

图论同时被 2 个专栏收录

7 篇文章

订阅专栏

dfs

3 篇文章

订阅专栏

本文详细介绍了使用迪杰斯特拉算法求解最短路径问题的方法，并通过代码实例展示了如何实现这一算法。同时，文章还讨论了在特定场景下，如何利用深搜来计算不同最短路径的数量。

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

A Walk Through the Forest

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5135 Accepted Submission(s): 1872

Problem Description

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.
The forest is beautiful, and Jimmy wants to take a different route everyday. He also wants to get home before dark, so he always takes a path to make progress towards his house. He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A. Calculate how many different routes through the forest Jimmy might take.

Input

Input contains several test cases followed by a line containing 0. Jimmy has numbered each intersection or joining of paths starting with 1. His office is numbered 1, and his house is numbered 2. The first line of each test case gives the number of intersections N, 1 < N ≤ 1000, and the number of paths M. The following M lines each contain a pair of intersections a b and an integer distance 1 ≤ d ≤ 1000000 indicating a path of length d between intersection a and a different intersection b. Jimmy may walk a path any direction he chooses. There is at most one path between any pair of intersections.

Output

For each test case, output a single integer indicating the number of different routes through the forest. You may assume that this number does not exceed 2147483647

Sample Input

Sample Output

2
4

用迪杰斯特拉算法求最短路，然后深搜得到其他的相同最短路径

代码如下：

#include<iostream>
#nclude<string.h>
#include<stdio.h>
using namespace std;
#define INF 1000000
int map[1005][1005],dis[1005],path[1005];
bool vis[1005];
int n;
void distra(int node)
{
	int i,j;
	memset(vis,0,sizeof(vis));
	for(i=0;i<=n;i++)
	{
		dis[i]=map[node][i];
	}
	vis[node]=1;
	dis[node]=0;
	for(i=1;i<=n;i++)
	{
		int min=INF,v=0;
		for(j=1;j<=n;j++)
		{
			if(!vis[j]&&dis[j]<min)
			{
				v=j;
				min=dis[j];
			}
		}
	
		vis[v]=1;
		for(j=1;j<=n;j++)
		{
			if(!vis[j]&&map[v][j]<INF&&dis[j]>dis[v]+map[v][j])
			{
				dis[j]=dis[v]+map[v][j];
			}
		}
	}
}//djistra算法模板，没必要解释
int dfs(int src)
{
	if(path[src]!=-1)
		return path[src];
	if(src==2)
		return 1;
	path[src]=0;//将深搜的点初始为0；
	for(int i=1;i<=n;i++)
	{
		if(dis[src]>dis[i]&&map[i][src]!=INF)
			path[src]+=dfs(i);//找到一条路径就加到原来的路径上
	}
return path[src];//注意返回值
}
int main()
{
	int m,i,j,a,b,di;
	while(cin>>n,n)
	{
		for(i=0;i<=n;i++)
		{
			for(j=0;j<=n;j++)
				map[i][j]=INF;
			map[i][i]=0;
		}//邻接矩阵初始无穷大
		cin>>m;
		while(m--)
		{
			cin>>a>>b>>di;
			map[b][a]=map[a][b]=di;
		}
		memset(dis,0,sizeof(dis));
		distra(2);
		memset(path,-1,sizeof(path));
		cout<<dfs(1)<<endl;
	}
	return 0;
}