图论
文章平均质量分 53
YRZ-James
who say you are not perfect?
展开
-
ALDS1_11_A:Graph
ALDS1_11_A:Graph 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_11_A 代码如下: #include<bits/stdc++.h> using namespace std; #define MAX 105 int main() { int n,u,k,v; int a[MAX][MAX]; scan...原创 2018-11-06 11:35:56 · 146 阅读 · 0 评论 -
ALDS1_11_B Depth First Search
ALDS1_11_B Depth First Search 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_11_B 代码如下: #include<bits/stdc++.h> using namespace std; #define MAX 105 #define WHITE 0 #define GREY 1 #define BLACK 2 ...原创 2018-11-06 12:16:35 · 223 阅读 · 0 评论 -
ALDS1_11_C:Breadth First Search
ALDS1_11_C:Breadth First Search 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_11_C 代码如下: #include<bits/stdc++.h> using namespace std; #define MAX 105 #define NIL -1 int a[MAX][MAX],d[MAX]; int n...原创 2018-11-06 13:00:40 · 121 阅读 · 0 评论 -
ALDS1_11_D:Connected Components
ALDS1_11_D:Connected Components 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_11_D 代码如下: #include&lt;bits/stdc++.h&gt; using namespace std; #define MAX 100005 #define NIL -1 int n; int a[MAX],color[MA...原创 2018-11-06 14:39:35 · 138 阅读 · 0 评论 -
ALDS1_12_B:Single Source Shortest Path I
ALDS1_12_B:Single Source Shortest Path I 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_12_B 代码如下: #include<bits/stdc++.h> using namespace std; #define MAX 105 #define NIL (1 << 21) #define ...原创 2018-11-09 16:32:44 · 215 阅读 · 0 评论 -
ALDS1_12_A:Minimun Spanning Tree
ALDS1_12_A:Minimun Spanning Tree 题目: https://cn.vjudge.net/problem/Aizu-ALDS1_12_A 代码如下: #include <bits/stdc++.h> using namespace std; #define MAX 105 #define NIL (1 << 21) #define WHITE 0...原创 2018-11-08 20:42:17 · 155 阅读 · 0 评论