B – Networking
You are assigned to design network connecti …
SPFA与链式前向星
https://blog.csdn.net/Binary_Heap/article/details/ …
A – Jungle Roads
The Head Elder of the tropical island of La …
边集数组
struct Edge{ int from,to,w; }; int first[MAX_V]; i …
Kruskal
Kruskal算法 此算法可以称为“加边法”，初始最小生成树边数为0，每迭代一次就选择一条满足条件的 …
最小生成树（概念）
转自：勿在浮沙筑高台[http://blog.csdn.net/luoshixian099/arti …
D – How Many Answers Are Wrong （思维+带权并查集）
TT and FF are … friends. Uh… very very …
L – Connections in Galaxy War （逆序并查集）
In order to strengthen the defense ability, many s …
N – Is It A Tree? （有向图判树/判环）
A tree is a well-known data structure that is eith …
M – 小希的迷宫（无向图判树）
上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon …