-
Notifications
You must be signed in to change notification settings - Fork 0
/
Dijkstra.cpp
149 lines (130 loc) · 2.55 KB
/
Dijkstra.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
//Dijkstra.cpp
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<fstream>
#include<stack>
#include<queue>
#include<cstring>
#include<map>
#include<iterator>
#include<list>
#include<set>
#include<functional>
#include<memory.h>
#include "Dijkstra.h"
using namespace std;
const int maxn=1e4;
const int M=1e7;
const int inf=0x3f3f3f3f;
typedef struct Edge{
int next;
int to;
int w;
}Edge;
Edge edge[M];
int head[maxn];
//int *pre;
bool visited[maxn];
typedef pair<int,int> pll;
int dis[maxn];
void init(){
memset(visited,false,sizeof(visited));
memset(dis,inf,sizeof(dis));
memset(head,-1,sizeof(head));
}
int n,m;
int cnt;
void add(int u,int v,int w){
edge[cnt].to=v;
edge[cnt].w=w;
edge[cnt].next=head[u];
head[u]=cnt++;
}
void dijkstra(int S,int *pre){
priority_queue<pll,vector<pll>,greater<pll> > q;
dis[S]=0;
q.push(pll(0,S));
pll temp;
cnt=0;
while(!q.empty()){
temp=q.top();
q.pop();
int u=temp.second;
if(visited[u])continue;
visited[u]=true;
int t,len;
for(int i=head[u];i!=-1;i=edge[i].next){
t=edge[i].to;len=edge[i].w;
if(!visited[t]&&dis[t]>dis[u]+len){
dis[t]=dis[u]+len;
pre[t]=u;//shabi
q.push(pll(dis[t],t));
}
}
}
}
void print_path(int root,int *pre)
{
while(root!=pre[root])
{
cout<<pro[root]<<"-->";
root = pre[root];
}
if(root == pre[root])
cout<<pro[root]<<endl;
}
int main(int argc, char *argv[ ]){
//while(cin>>n>>m){
//int u,v,w;
//init();
//for(int i=0;i<m;i++){
//cin>>u>>v>>w;
//add(u,v,w);
//add(v,u,w);
//}
//利用接口的预处理
char input[100];
cout << "please input your protein net file\n";
cin>>input;
num_protein_make(input);
int count;
count = array_make();
int flag1,flag2;
judge (argc,count,argv[1],argv[2], &flag1, &flag2);
int count2;
count2=creat_new(input,count);
int n,m;
n=count;
m=count2;
//pre=(int *)malloc(sizeof(int)*n);
int *pre=new int[n];
int u,v,w;
init();
ifstream infile;
//ofstream outfile;
infile.open("new.txt", ios::in);
if(!infile.is_open ())
cout << "Open file failure" << endl;
while (!infile.eof())
{
infile >> u >> v >> w;
add(u,v,w);
add(v,u,w);
}
infile.close();
int S,E;
S=flag1;
E=flag2;
pre[S]=S;
dijkstra(S,pre);
cout<< "the shortest way score is " <<dis[E]<<endl;
cout<<"Path: "<<endl;
print_path(E,pre);
delete[] pre;
return 0;
}