Essays on algorithms and data structures by Ali Khalilli. Binary search, numerical methods, dynamic programming, graphs, strings. Zola 2022-05-28T00:00:00+00:00 https://invariant.khalilli.ai/tags/sssp/atom.xml 2022-05-28T00:00:00+00:00 2022-05-28T00:00:00+00:00 alikhalilli https://invariant.khalilli.ai/blog/floyd-warshall/

<p>When I saw this algorithm for a first time, It reminded me <strong>the Matrix Chain Multiplication</strong>, so therefore didn’t think about that much “how does it work?”, “why does it work?”. Because, MCM problem seems much more interval DP(anyway, it’s acyclic DAG) because of it’s vibe of linearity.<br/> Let’s think the problem gradually from simpler to harder, 1. graph is completely linear OR topologically sorted, 2. graph nodes have all the connections pairwise. For simplicity, let’s look at linear graph model.</p>