Warning: session_start(): open(/tmp/sess_af8c979fe7701790cfbb220c7b2c5f86, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239
Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 40
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 41
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 42
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 43
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/httputils.php on line 28
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/httputils.php on line 29 CVBB ACM Team 2020-2021:teams:namespace:kongyou
https://wiki.cvbbacm.com/
2026-06-18T16:26:57+0800CVBB ACM Team
https://wiki.cvbbacm.com/
https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.icotext/html2020-05-25T00:15:40+0800Anonymous (anonymous@undisclosed.example.com)2020-2021:teams:namespace:kongyou:图论相关
https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:namespace:kongyou:%E5%9B%BE%E8%AE%BA%E7%9B%B8%E5%85%B3&rev=1590336940&do=diff
离散数学2 图论
1. 基本概念
2.Dijkstra算法（最短路径）
3.关于树的概念图谱
4. 生成树与最小生成树text/html2020-05-16T12:12:10+0800Anonymous (anonymous@undisclosed.example.com)2020-2021:teams:namespace:kongyou:并查集
https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:namespace:kongyou:%E5%B9%B6%E6%9F%A5%E9%9B%86&rev=1589602330&do=diff
并查集
什么是并查集（Disjoint-set）
对于一个集合S={a1, a2, ..., an-1, an}，我们还可以对集合S进一步划分: S1,S2,...,Sm-1,Sm，我们希望能够快速确定S中的两两元素是否属于S的同一子集。
举个栗子，S={0，1, 2, 3, 4, 5, 6}，如果我们按照一定的规则对集合S进行划分,假设划分后为S1={1, 2, 4}, S2={3, 6}，S3={0, 5}，任意给定两个元素，我们如何确定它们是否属于同一子集？某些合并子集后，又如何确定两两关系？基于此类问题便出现了并查集这种数据结构。…text/html2020-05-16T11:29:38+0800Anonymous (anonymous@undisclosed.example.com)2020-2021:teams:namespace:kongyou:深度优先搜索
https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:namespace:kongyou:%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2&rev=1589599778&do=diff
深度优先搜索(DFS)
过程简要来说是对每一个可能的分支路径深入到不能再深入为止，而且每个节点只能访问一次.
深度优先搜索的特点：每次深度优先搜索的结果必然是图的一个连通分量.深度优先搜索可以从多点发起.如果将每个节点在深度优先搜索过程中的