https://www.geeksforgeeks.org/number-of-paths-from-source-to-destination-in-a-directed-acyclic-graph/ 拓扑排序+动态规划，好厉害 Let f(u) be the number of ways one can travel from node u to destination vertex. ...

https://www.geeksforgeeks.org/roots-tree-gives-minimum-height/Given an undirected graph, which has tree characteristics (any connected graph without simple cycles is a tree.). It is possible to cho...

https://www.techiedelight.com/2-vertex-connectivity-graph/http://www.cs.rpi.edu/~goldberg/14-GT/08-block.pdf 无向图DFSWe can find Articulation points in a graph using Depth–first search (DFS).We can s...

https://zh.wikipedia.org/wiki/%E8%B7%B3%E8%B7%83%E5%88%97%E8%A1%A8 概述 使得包含n个元素的有序序列的查找和插入操作的平均时间复杂度都是O(log n)，优于数组的O(n)复杂度 一个多层次的链表。与前一层（下面一层）链表元素的数量相比，每一层链表中的元素的数量更少。每一层是有序的 构造跳跃列表是按层建造的。底层是一个普...

https://docs.nebula-graph.com.cn/3.2.0/1.introduction/3.nebula-graph-architecture/4.storage-service/#raft https://cloud.tencent.com/developer/article/1826594 简介 分布式系统中，同一份数据通常会有多个副本，这样即使少数副本发生故障，...

生成树最大生成树的性质

defintions unit network单位网络：每个顶点要么只有一条出边且容量为1，要么只有一条入边且容量为1 unit capacity network单位容量网络：所有边容量=1 reductions of problem versionundirected->directed https://stackoverflow.com/questions/297416...

https://zh.wikipedia.org/zh-cn/%E5%A4%9A%E5%B0%8D%E6%95%B8%E5%87%BD%E6%95%B8

The-Art-Of-Programming-By-July/03.01.md at master · julycoding/The-Art-Of-Programming-By-July (github.com) 红黑树本质上是一棵近似平衡的二叉查找树 红黑树的查找、插入、删除的时间复杂度最坏为O(log n) 回顾：二叉查找树 若任意结点的左子树不空，则左子树上所有...