SPFA随手写,容易理解的
2016-01-23 20:32
274 查看
对应的图是
// spfa.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <queue>
#include<vector>
using namespace std;
int graph[8][8];
#include<string>
bool visited[8];
int dis[8];
int pre[8];
void spfa(int graph[][8],int s,int e,int n)
{
memset(visited,false,sizeof(visited));
memset(dis,127,sizeof(dis));
memset(pre,0,sizeof(pre));
queue<int> q;
q.push(s);
visited[s]=true;
dis[s]=0;
while(!q.empty())
{
int top=q.front();
q.pop();
visited[top]=false;
for (int i=0;i<n;i++)
{
if (graph[top][i]!=0)
{
if (dis[i]>dis[top]+graph[top][i])
{
dis[i]=dis[top]+graph[top][i];
if(!visited[i])
{
visited[i]=true;
q.push(i);
}
}
}
}
}
for (int i=0;i<n;i++)
{
cout<<i<<" "<<dis[i]<<endl;
}
}
int _tmain(int argc, _TCHAR* argv[])
{
memset(graph,0,sizeof(graph));
graph[0][1]=24;
graph[0][2]=8;
graph[0][3]=15;
graph[1][4]=6;
graph[2][4]=7;
graph[2][5]=3;
graph[3][6]=4;
graph[4][6]=9;
graph[5][6]=3;
graph[5][4]=2;
graph[6][1]=3;
spfa(graph,0,6,7);
return 0;
}
// spfa.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <queue>
#include<vector>
using namespace std;
int graph[8][8];
#include<string>
bool visited[8];
int dis[8];
int pre[8];
void spfa(int graph[][8],int s,int e,int n)
{
memset(visited,false,sizeof(visited));
memset(dis,127,sizeof(dis));
memset(pre,0,sizeof(pre));
queue<int> q;
q.push(s);
visited[s]=true;
dis[s]=0;
while(!q.empty())
{
int top=q.front();
q.pop();
visited[top]=false;
for (int i=0;i<n;i++)
{
if (graph[top][i]!=0)
{
if (dis[i]>dis[top]+graph[top][i])
{
dis[i]=dis[top]+graph[top][i];
if(!visited[i])
{
visited[i]=true;
q.push(i);
}
}
}
}
}
for (int i=0;i<n;i++)
{
cout<<i<<" "<<dis[i]<<endl;
}
}
int _tmain(int argc, _TCHAR* argv[])
{
memset(graph,0,sizeof(graph));
graph[0][1]=24;
graph[0][2]=8;
graph[0][3]=15;
graph[1][4]=6;
graph[2][4]=7;
graph[2][5]=3;
graph[3][6]=4;
graph[4][6]=9;
graph[5][6]=3;
graph[5][4]=2;
graph[6][1]=3;
spfa(graph,0,6,7);
return 0;
}
相关文章推荐
- 简单的四则运算
- 数的奇偶性
- ACM网址
- 1272 小希的迷宫
- 1272 小希的迷宫
- hdu 1250 大数相加并用数组储存
- 矩阵的乘法操作
- 蚂蚁爬行问题
- 蚂蚁爬行问题
- 求两个数的最大公约数【ACM基础题】
- 打印出二进制中所有1的位置
- 杭电题目---一只小蜜蜂
- HDOJ 1002 A + B Problem II (Big Numbers Addition)
- 初学ACM - 半数集(Half Set)问题 NOJ 1010 / FOJ 1207
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points