难见的空格码风/se
by Gemini7X @ 2020-08-24 22:06:22
你说这是dij是认真吗？
dij的话大概是这个样子
```cpp
void Dijkstra() {
memset(Dis, 0x3f, sizeof Dis);
Dis[1] = 0;
memset(In, false, sizeof In);
priority_queue<Node> q;
q.push(Node(1, 0));
while(!q.empty()) {
Node u = q.top();
q.pop();
if (In[u.to]) continue;
In[u.to] = ture;
for(int i = Head[u.to]; i; i = E[i].nxt) {
int v = E[i].to, w = E[i].val;
if(u.val + w < Dis[v]) {
Dis[v] = u.val + w;
if(!In[v])
q.push(Node(v, Dis[v]));
}
}
}
}
```
by STPGUY @ 2020-08-24 22:06:22
蒟蒻问一句，为什么写两个dijkstra？？
by fanypcd @ 2020-08-24 22:06:25
142857爷说这个算法是假的。
by Gemini7X @ 2020-08-24 22:07:52
@[L__H](/user/57896) ~~ture好评~~
谢谢，我去看看
by EggShell123 @ 2020-08-24 22:07:54
@[fanypcd](/user/90027) 因为正反建图各跑一遍
by EggShell123 @ 2020-08-24 22:08:17
~~用户名好评~~
by _5011_ @ 2020-08-24 22:08:26
写假了/jk，不知不觉写成SPFA了
by EggShell123 @ 2020-08-24 22:09:08
@[Zephyr_](/user/91127) stO ClCN
by EggShell123 @ 2020-08-24 22:09:23
建反图不能分两次吗
by fanypcd @ 2020-08-24 22:10:25