alpha202的博客

定义：生成树：在无向连通图G=(V,E)G=(V,E)G=(V,E)中，连通所有点并且没有回路的图为GGG的生成树。若该无向图有nnn个点，则它有n−1n-1n−1条边。若一棵生成树插入一条无向边(u,v)(u,v)(u,v)，则会形成一条回路。最小生成树：(MST)我们规定(u,v)(u,v)(u,v)为一条以uuu为起点，vvv为终点的边，w(u,v)w(u,v...

How to change the value of all the nodes passing through the shortest path of two nodes in a tree?Obviously this can be achieved by tree difference.How to find the sum of weights on the shortest pat...