https://leetcode.com/problems/network-delay-time/description/
Network Delay Time - LeetCode
Network Delay Time - You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a
leetcode.com
https://leetcode.com/problems/path-with-maximum-probability/description/
Path with Maximum Probability - LeetCode
Path with Maximum Probability - You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected edge connecting the nodes a and b with a probability of success of traversing th
leetcode.com
https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/description/
Number of Ways to Arrive at Destination - LeetCode
Number of Ways to Arrive at Destination - You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. The inputs are generated such that you can reach any intersection from any other int
leetcode.com
'뇌세포덩어리"" > 알고리즘' 카테고리의 다른 글
| [baekjoon] union-find (0) | 2023.02.17 |
|---|---|
| [baekjoon] dijkstra 문제들 (0) | 2023.02.17 |
| [leetcode] union find 문제들 (0) | 2023.02.03 |
| [leetcode] dfs / bfs 재밌는 문제들 (0) | 2023.02.03 |
| [leetcode] dfs/bfs 섬 문제들 (0) | 2023.02.01 |