Categorygithub.com/szhou12/leetcode-goleetcode2642-Design-Graph-With-Shortest-Path-Calculator
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

2642. Design Graph With Shortest Path Calculator

Solution idea

Floyd-Warshall Algorithm

  1. Floyd算法典型例题。
  2. Floyd算法在 有向图 上的应用。

Time complexity = $O(E \times n^2)$

Resource

【每日一题】LeetCode 2642. Design Graph With Shortest Path Calculator