Update multistage-graph.md

Yashgabani845 · web-flow · commit 7b83680f90e3 · 2024-06-08T12:16:29.000+05:30
diff --git a/dsa/Algorithms/multistage-graph.md b/dsa/Algorithms/multistage-graph.md
@@ -222,4 +222,4 @@ The shortest path cost is 17.
 
 ## Conclusion
 
-The Multistage Graph Algorithm efficiently finds the shortest path in a graph divided into stages. It operates in O(V^2) time complexity, making it suitable for graphs with a structured stage-based layout. Understanding and implementing this algorithm is essential for solving complex optimization problems in various applications.
+The Multistage Graph Algorithm efficiently finds the shortest path in a graph divided into stages. It operates in $O(V^2)$ time complexity, making it suitable for graphs with a structured stage-based layout. Understanding and implementing this algorithm is essential for solving complex optimization problems in various applications.

Original file line number	Diff line number	Diff line change
`@@ -222,4 +222,4 @@ The shortest path cost is 17.`
`222`	`222`
`223`	`223`	`## Conclusion`
`224`	`224`
`225`		`-The Multistage Graph Algorithm efficiently finds the shortest path in a graph divided into stages. It operates in O(V^2) time complexity, making it suitable for graphs with a structured stage-based layout. Understanding and implementing this algorithm is essential for solving complex optimization problems in various applications.`
	`225`	`+The Multistage Graph Algorithm efficiently finds the shortest path in a graph divided into stages. It operates in $O(V^2)$ time complexity, making it suitable for graphs with a structured stage-based layout. Understanding and implementing this algorithm is essential for solving complex optimization problems in various applications.`