From 3f21a99cd84a65508d3bc5d0d99a5a3945cfe909 Mon Sep 17 00:00:00 2001
From: Pei Zhao <pei.zhao.cs@gmail.com>
Date: Fri, 8 May 2026 16:02:45 -0700
Subject: [PATCH] Update LC 787 article to clarify eager vs lazy pruning for
 dense graphs

---
 articles/cheapest-flight-path.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/articles/cheapest-flight-path.md b/articles/cheapest-flight-path.md
index bb2f88a17..02002bb51 100644
--- a/articles/cheapest-flight-path.md
+++ b/articles/cheapest-flight-path.md
@@ -1032,7 +1032,7 @@ impl Solution {
 
 ### Time & Space Complexity
 
-- Time complexity: $O(n * k)$
+- Time complexity: $O(m * k)$
 - Space complexity: $O(n + m)$
 
 > Where $n$ is the number of cities, $m$ is the number of flights and $k$ is the number of stops.