友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

微信

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

Graph 图

经典题目

  1. 133. Clone Graph

  2. 207. 课程表

  3. 210. Course Schedule II

  4. [0261-graph-valid-tree]

  5. [0269-alien-dictionary]

  6. [0277-find-the-celebrity]

  7. [0310-minimum-height-trees]

  8. [0323-number-of-connected-components-in-an-undirected-graph]

  9. [0329-longest-increasing-path-in-a-matrix]

  10. [0332-reconstruct-itinerary]

  11. [0399-evaluate-division]

  12. [0444-sequence-reconstruction]

  13. [0499-the-maze-iii]

  14. [0505-the-maze-ii]

  15. 547. 省份数量

  16. [0631-design-excel-sum-formula]

  17. [0684-redundant-connection]

  18. [0685-redundant-connection-ii]

  19. [0743-network-delay-time]

  20. [0753-cracking-the-safe]

  21. [0765-couples-holding-hands]

  22. [0785-is-graph-bipartite]

  23. [0787-cheapest-flights-within-k-stops]

  24. [0797-all-paths-from-source-to-target]

  25. [0802-find-eventual-safe-states]

  26. [0834-sum-of-distances-in-tree]

  27. [0841-keys-and-rooms]

  28. [0847-shortest-path-visiting-all-nodes]

  29. [0851-loud-and-rich]

  30. [0882-reachable-nodes-in-subdivided-graph]

  31. [0886-possible-bipartition]

  32. [0913-cat-and-mouse]

  33. [0924-minimize-malware-spread]

  34. [0928-minimize-malware-spread-ii]

  35. [0947-most-stones-removed-with-same-row-or-column]

  36. [0990-satisfiability-of-equality-equations]

  37. [0997-find-the-town-judge]

  38. [1042-flower-planting-with-no-adjacent]

  39. [1059-all-paths-from-source-lead-to-destination]

  40. [1129-shortest-path-with-alternating-colors]

  41. [1135-connecting-cities-with-minimum-cost]

  42. [1136-parallel-courses]

  43. [1168-optimize-water-distribution-in-a-village]

  44. [1192-critical-connections-in-a-network]

  45. [1203-sort-items-by-groups-respecting-dependencies]

  46. [1245-tree-diameter]

  47. [1298-maximum-candies-you-can-get-from-boxes]

  48. [1311-get-watched-videos-by-your-friends]

  49. [1319-number-of-operations-to-make-network-connected]

  50. [1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance]

  51. [1361-validate-binary-tree-nodes]

  52. [1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid]

  53. [1377-frog-position-after-t-seconds]

  54. [1462-course-schedule-iv]

  55. [1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero]

  56. [1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree]

  57. [1494-parallel-courses-ii]

  58. [1514-path-with-maximum-probability]

  59. [1548-the-most-similar-path-in-a-graph]

  60. [1557-minimum-number-of-vertices-to-reach-all-nodes]

  61. [1579-remove-max-number-of-edges-to-keep-graph-fully-traversable]

  62. [1584-min-cost-to-connect-all-points]

  63. [1591-strange-printer-ii]

  64. [1615-maximal-network-rank]

  65. [1632-rank-transform-of-a-matrix]

  66. [1697-checking-existence-of-edge-length-limited-paths]

  67. [1719-number-of-ways-to-reconstruct-a-tree]

  68. [1724-checking-existence-of-edge-length-limited-paths-ii]

  69. [1728-cat-and-mouse-ii]

  70. [1761-minimum-degree-of-a-connected-trio-in-a-graph]

  71. [1778-shortest-path-in-a-hidden-grid]

  72. [1782-count-pairs-of-nodes]

  73. [1786-number-of-restricted-paths-from-first-to-last-node]

  74. [1791-find-center-of-star-graph]

  75. [1810-minimum-path-cost-in-a-hidden-grid]

  76. [1820-maximum-number-of-accepted-invitations]

  77. [1857-largest-color-value-in-a-directed-graph]

  78. [1916-count-ways-to-build-rooms-in-an-ant-colony]

  79. [1928-minimum-cost-to-reach-destination-in-time]

  80. [1971-find-if-path-exists-in-graph]

  81. [1976-number-of-ways-to-arrive-at-destination]

  82. [2039-the-time-when-the-network-becomes-idle]

  83. [2045-second-minimum-time-to-reach-destination]

  84. [2050-parallel-courses-iii]

  85. [2065-maximum-path-quality-of-a-graph]

  86. [2076-process-restricted-friend-requests]

  87. [2077-paths-in-maze-that-lead-to-same-room]

  88. [2092-find-all-people-with-secret]

  89. [2093-minimum-cost-to-reach-city-with-discounts]

  90. [2097-valid-arrangement-of-pairs]

  91. [2101-detonate-the-maximum-bombs]

  92. [2115-find-all-possible-recipes-from-given-supplies]

  93. [2123-minimum-operations-to-remove-adjacent-ones-in-matrix]

  94. [2127-maximum-employees-to-be-invited-to-a-meeting]

  95. [2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph]

  96. [2203-minimum-weighted-subgraph-with-the-required-paths]

  97. [2204-distance-to-a-cycle-in-undirected-graph]

  98. [2242-maximum-score-of-a-node-sequence]

  99. [2246-longest-path-with-different-adjacent-characters]

  100. [2247-maximum-cost-of-trip-with-k-highways]

  101. [2285-maximum-total-importance-of-roads]

  102. [2290-minimum-obstacle-removal-to-reach-corner]

  103. [2297-jump-game-viii]

  104. [2307-check-for-contradictions-in-equations]

  105. [2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph]

  106. [2328-number-of-increasing-paths-in-a-grid]

  107. [2359-find-closest-node-to-given-two-nodes]

  108. [2360-longest-cycle-in-a-graph]

  109. [2368-reachable-nodes-with-restrictions]

  110. [2371-minimize-maximum-value-in-a-grid]

  111. [2374-node-with-highest-edge-score]

  112. [2392-build-a-matrix-with-conditions]

  113. [2421-number-of-good-paths]

  114. [2467-most-profitable-path-in-a-tree]

  115. [2473-minimum-cost-to-buy-apples]

  116. [2477-minimum-fuel-cost-to-report-to-the-capital]

  117. [2479-maximum-xor-of-two-non-overlapping-subtrees]

  118. [2492-minimum-score-of-a-path-between-two-cities]

  119. [2493-divide-nodes-into-the-maximum-number-of-groups]

  120. [2497-maximum-star-sum-of-a-graph]

  121. [2508-add-edges-to-make-degrees-of-all-nodes-even]

  122. [2577-minimum-time-to-visit-a-cell-in-a-grid]

  123. [2603-collect-coins-in-a-tree]

  124. [2608-shortest-cycle-in-a-graph]

  125. [2642-design-graph-with-shortest-path-calculator]

  126. [2646-minimize-the-total-price-of-the-trips]

  127. [2662-minimum-cost-of-a-path-with-special-roads]

  128. [2685-count-the-number-of-complete-components]

  129. [2699-modify-graph-edge-weights]

  130. [2714-find-shortest-path-with-k-hops]

  131. [2737-find-the-closest-marked-node]

  132. [2846-minimum-edge-weight-equilibrium-queries-in-a-tree]

  133. [2858-minimum-edge-reversals-so-every-node-is-reachable]

  134. [2876-count-visited-nodes-in-a-directed-graph]

  135. [2924-find-champion-ii]

  136. [2959-number-of-possible-sets-of-closing-branches]

  137. [2976-minimum-cost-to-convert-string-i]

  138. [2977-minimum-cost-to-convert-string-ii]

  139. [3015-count-the-number-of-houses-at-a-certain-distance-i]

  140. [3017-count-the-number-of-houses-at-a-certain-distance-ii]

  141. [3108-minimum-cost-walk-in-weighted-graph]

  142. [3112-minimum-time-to-visit-disappearing-nodes]

  143. [3123-find-edges-in-shortest-paths]

  144. [3203-find-minimum-diameter-after-merging-two-trees]

  145. [3241-time-taken-to-mark-all-nodes]

  146. [3243-shortest-distance-after-road-addition-queries-i]

  147. [3244-shortest-distance-after-road-addition-queries-ii]

  148. [3286-find-a-safe-walk-through-a-grid]

  149. [3310-remove-methods-from-project]

  150. [3311-construct-2d-grid-matching-graph-layout]

  151. [3341-find-minimum-time-to-reach-last-room-i]

  152. [3342-find-minimum-time-to-reach-last-room-ii]

  153. [3377-digit-operations-to-make-two-integers-equal]

  154. [3383-minimum-runes-to-add-to-cast-spell]

  155. [3385-minimum-time-to-break-locks-ii]

  156. [3387-maximize-amount-after-two-days-of-conversions]

  157. [3419-minimize-the-maximum-edge-weight-of-graph]

  158. [3435-frequencies-of-shortest-supersequences]

  159. [3481-apply-substitutions]

  160. [3493-properties-graph]

← Previous: Heap 堆 | ↑ Up: LeetCode 解题笔记 | Next: Recursion 递归 →