码迷,mamicode.com
首页 >  
搜索关键字:connected    ( 1446个结果
Win10磁盘占用率过高
打开服务 禁用Superfetch 禁用Windows Search 禁用Connected User Experiences and Telemetry 禁用Windows Update【恢复选项卡:全部改成无操作】 禁用HomeGroup Listener 禁用HomeGroup Provide ...
分类:Windows程序   时间:2019-02-17 10:58:21    阅读次数:160
『Tarjan算法 有向图的强连通分量』
有向图的强连通分量 定义:在有向图$G$中,如果两个顶点$v_i,v_j$间$(v_i v_j)$有一条从$v_i$到$v_j$的有向路径,同时还有一条从$v_j$到$v_i$的有向路径,则称两个顶点强连通(strongly connected)。如果有向图$G$的每两个顶点都强连通,称$G$是一个 ...
分类:编程语言   时间:2019-02-16 20:45:43    阅读次数:192
「POJ1679 」The Unique MST
题目描述 Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected g ...
分类:其他好文   时间:2019-02-16 00:06:05    阅读次数:170
PAT A1013 Battle Over Cities (25 分)
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c ...
分类:其他好文   时间:2019-02-15 14:02:17    阅读次数:143
PTA-1021—— Deepest Root(最后两组数据错误)
题目: A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find ...
分类:其他好文   时间:2019-02-12 13:19:24    阅读次数:222
Query on a tree II 倍增LCA
You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned t ...
分类:其他好文   时间:2019-02-07 21:56:19    阅读次数:134
Query on a tree 树链剖分 [模板]
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructi ...
分类:其他好文   时间:2019-02-07 10:47:56    阅读次数:115
PAT 甲级 1021 Deepest Root
https://pintia.cn/problem-sets/994805342720868352/problems/994805482919673856 A graph which is connected and acyclic can be considered a tree. The hig ...
分类:其他好文   时间:2019-02-06 09:34:51    阅读次数:152
Max Area of Island
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) Yo ...
分类:其他好文   时间:2019-02-03 10:28:29    阅读次数:185
Codeforces 1108F MST Unification MST + LCA
Codeforces 1108F MST + LCA F. MST Unification Description: You are given an undirected weighted connected graph with $n$ vertices and $m$ edges withou ...
分类:其他好文   时间:2019-02-03 00:52:45    阅读次数:156
1446条   上一页 1 ... 25 26 27 28 29 ... 145 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!