Categorygithub.com/szhou12/leetcode-goleetcode3112-Minimum-Time-to-Visit-Disappearing-Nodes
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

3112. Minimum Time to Visit Disappearing Nodes

Solution idea

Dijkstra

  1. 典型题。from node 0确定是single-source (唯一起点) + 所有边权都是正数 = 确认使用Dijkstra
  2. 题目中disappear[]的意义：每次pop current node时，如果最短路径到达时已经超过了"时限"，则不能更新到达的最短路径，同时，无法从current node进行expand。

Time complexity = $O(E \log E)$

Resource

【每日一题】LeetCode 3112. Minimum Time to Visit Disappearing Nodes