## 图

| \# | 题名 | 题解 | 通过率 | 难度 | 出现频率   |
|------|----------------------|-----|--------|----|--------|
|269|[火星词典](https://leetcode-cn.com/problems/alien-dictionary)   |[18](https://leetcode-cn.com/problems/alien-dictionary/solution)|38.4%|困难|51.45%|
|1203|[项目管理](https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies)   |[5](https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies/solution)|32.0%|困难|49.92%|
|839|[相似字符串组](https://leetcode-cn.com/problems/similar-string-groups)   |[16](https://leetcode-cn.com/problems/similar-string-groups/solution)|28.9%|困难|39.06%|
|928|[尽量减少恶意软件的传播 II](https://leetcode-cn.com/problems/minimize-malware-spread-ii)   |[7](https://leetcode-cn.com/problems/minimize-malware-spread-ii/solution)|37.9%|困难|32.98%|
|1162|[地图分析](https://leetcode-cn.com/problems/as-far-from-land-as-possible)   |[30](https://leetcode-cn.com/problems/as-far-from-land-as-possible/solution)|36.6%|中等|32.17%|
|1153|[字符串转化](https://leetcode-cn.com/problems/string-transforms-into-another-string)   |[9](https://leetcode-cn.com/problems/string-transforms-into-another-string/solution)|29.6%|困难|32.07%|
|1043|[分隔数组以得到最大和](https://leetcode-cn.com/problems/partition-array-for-maximum-sum)   |[9](https://leetcode-cn.com/problems/partition-array-for-maximum-sum/solution)|61.8%|中等|28.24%|
|743|[网络延迟时间](https://leetcode-cn.com/problems/network-delay-time)   |[24](https://leetcode-cn.com/problems/network-delay-time/solution)|44.7%|中等|27.01%|
|399|[除法求值](https://leetcode-cn.com/problems/evaluate-division)   |[39](https://leetcode-cn.com/problems/evaluate-division/solution)|52.7%|中等|22.97%|
|310|[最小高度树](https://leetcode-cn.com/problems/minimum-height-trees)   |[21](https://leetcode-cn.com/problems/minimum-height-trees/solution)|32.9%|中等|21.8%|
|996|[正方形数组的数目](https://leetcode-cn.com/problems/number-of-squareful-arrays)   |[10](https://leetcode-cn.com/problems/number-of-squareful-arrays/solution)|42.1%|困难|21.72%|
|207|[课程表](https://leetcode-cn.com/problems/course-schedule)   |[57](https://leetcode-cn.com/problems/course-schedule/solution)|48.5%|中等|18.71%|
|133|[克隆图](https://leetcode-cn.com/problems/clone-graph)   |[47](https://leetcode-cn.com/problems/clone-graph/solution)|47.9%|中等|17.12%|
|765|[情侣牵手](https://leetcode-cn.com/problems/couples-holding-hands)   |[28](https://leetcode-cn.com/problems/couples-holding-hands/solution)|55.2%|困难|16.52%|
|997|[找到小镇的法官](https://leetcode-cn.com/problems/find-the-town-judge)   |[40](https://leetcode-cn.com/problems/find-the-town-judge/solution)|49.2%|简单|15.45%|
|332|[重新安排行程](https://leetcode-cn.com/problems/reconstruct-itinerary)   |[15](https://leetcode-cn.com/problems/reconstruct-itinerary/solution)|34.0%|中等|14.96%|
|802|[找到最终的安全状态](https://leetcode-cn.com/problems/find-eventual-safe-states)   |[12](https://leetcode-cn.com/problems/find-eventual-safe-states/solution)|44.9%|中等|14.19%|
|1129|[颜色交替的最短路径](https://leetcode-cn.com/problems/shortest-path-with-alternating-colors)   |[18](https://leetcode-cn.com/problems/shortest-path-with-alternating-colors/solution)|33.2%|中等|14.11%|
|785|[判断二分图](https://leetcode-cn.com/problems/is-graph-bipartite)   |[27](https://leetcode-cn.com/problems/is-graph-bipartite/solution)|41.9%|中等|13.34%|
|685|[冗余连接 II](https://leetcode-cn.com/problems/redundant-connection-ii)   |[12](https://leetcode-cn.com/problems/redundant-connection-ii/solution)|32.5%|困难|12.78%|
|210|[课程表 II](https://leetcode-cn.com/problems/course-schedule-ii)   |[38](https://leetcode-cn.com/problems/course-schedule-ii/solution)|45.5%|中等|11.26%|
|990|[等式方程的可满足性](https://leetcode-cn.com/problems/satisfiability-of-equality-equations)   |[18](https://leetcode-cn.com/problems/satisfiability-of-equality-equations/solution)|37.2%|中等|11.18%|
|323|[无向图中连通分量的数目](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph)   |[21](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph/solution)|52.7%|中等|10.25%|
|1042|[不邻接植花](https://leetcode-cn.com/problems/flower-planting-with-no-adjacent)   |[32](https://leetcode-cn.com/problems/flower-planting-with-no-adjacent/solution)|45.7%|简单|9.61%|
|841|[钥匙和房间](https://leetcode-cn.com/problems/keys-and-rooms)   |[29](https://leetcode-cn.com/problems/keys-and-rooms/solution)|58.5%|中等|8.47%|
|684|[冗余连接](https://leetcode-cn.com/problems/redundant-connection)   |[35](https://leetcode-cn.com/problems/redundant-connection/solution)|54.6%|中等|4.93%|
|1267|[统计参与通信的服务器](https://leetcode-cn.com/problems/count-servers-that-communicate)   |[25](https://leetcode-cn.com/problems/count-servers-that-communicate/solution)|58.1%|中等|3.34%|
|1168|[水资源分配优化](https://leetcode-cn.com/problems/optimize-water-distribution-in-a-village)   |[5](https://leetcode-cn.com/problems/optimize-water-distribution-in-a-village/solution)|36.4%|困难|&nbsp;|
|1161|[最大层内元素和](https://leetcode-cn.com/problems/maximum-level-sum-of-a-binary-tree)   |[27](https://leetcode-cn.com/problems/maximum-level-sum-of-a-binary-tree/solution)|66.4%|中等|&nbsp;|
|1136|[平行课程](https://leetcode-cn.com/problems/parallel-courses)   |[5](https://leetcode-cn.com/problems/parallel-courses/solution)|49.1%|困难|&nbsp;|
|1135|[最低成本联通所有城市](https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost)   |[5](https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost/solution)|38.4%|中等|&nbsp;|
|1102|[得分最高的路径](https://leetcode-cn.com/problems/path-with-maximum-minimum-value)   |[11](https://leetcode-cn.com/problems/path-with-maximum-minimum-value/solution)|25.8%|中等|&nbsp;|
|959|[由斜杠划分区域](https://leetcode-cn.com/problems/regions-cut-by-slashes)   |[11](https://leetcode-cn.com/problems/regions-cut-by-slashes/solution)|63.1%|中等|&nbsp;|
|854|[相似度为 K 的字符串](https://leetcode-cn.com/problems/k-similar-strings)   |[15](https://leetcode-cn.com/problems/k-similar-strings/solution)|26.3%|困难|&nbsp;|
|1059|[从始点到终点的所有路径](https://leetcode-cn.com/problems/all-paths-from-source-lead-to-destination)   |[5](https://leetcode-cn.com/problems/all-paths-from-source-lead-to-destination/solution)|26.5%|中等|&nbsp;|
|444|[序列重建](https://leetcode-cn.com/problems/sequence-reconstruction)   |[6](https://leetcode-cn.com/problems/sequence-reconstruction/solution)|20.9%|中等|&nbsp;|
|261|[以图判树](https://leetcode-cn.com/problems/graph-valid-tree)   |[19](https://leetcode-cn.com/problems/graph-valid-tree/solution)|42.7%|中等|&nbsp;|
