From 6abd9b7ed9ade87e74e97e54b0ccf2c26bf559f6 Mon Sep 17 00:00:00 2001 From: Alejandro Candioti Date: Fri, 5 Dec 2025 07:45:44 -0600 Subject: [PATCH] Update date and correct link in hacking shortest paths post Updated the publication date and fixed a link in the article. --- content/posts/networkx/hacking-shortest-paths/index.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/posts/networkx/hacking-shortest-paths/index.md b/content/posts/networkx/hacking-shortest-paths/index.md index 597af4b..aaa8867 100644 --- a/content/posts/networkx/hacking-shortest-paths/index.md +++ b/content/posts/networkx/hacking-shortest-paths/index.md @@ -2,7 +2,7 @@ title: "Hacking Shortest Paths: Solve Harder Problems by Tweaking Graphs" description: "Modeling Constraints in Shortest Path Problems using NetworkX and Graph Transformations" summary: "Many real-world shortest path problems include constraints that classic algorithms don’t directly handle. NetworkX provides robust, optimized implementations of algorithms like Dijkstra’s, Bellman-Ford, and A*. But what if your problem doesn’t fit the classic shortest path formulation?" -date: 2025-08-03 +date: 2025-12-04 draft: false tags: ["networkx", "shortest-paths", "dijkstra"] displayInList: true @@ -14,7 +14,7 @@ resources: showOnTop: false --- -Many **real-world shortest path problems** include constraints that classic algorithms don’t directly handle. [NetworkX](https://networkx.org/) provides robust, optimized implementations of [algorithms](https://networkx.org/documentation/stable/reference/algorithms/shortest_paths.html) like Dijkstra’s, Bellman-Ford, and A\*. But what if your problem doesn’t fit the classic shortest path formulation? +Many **real-world shortest path problems** include constraints that classic algorithms don’t directly handle. [NetworkX](https://networkx.org/) provides robust, optimized implementations of [algorithms](https://networkx.org/documentation/stable/reference/algorithms/shortest_paths/index.html) like Dijkstra’s, Bellman-Ford, and A\*. But what if your problem doesn’t fit the classic shortest path formulation? Instead of designing a new algorithm from scratch, a powerful approach is to **transform your problem into a standard shortest path query by modifying the input graph**. This lets you **leverage existing, well-tested tools**.