ReadMeFeed / Community knowledge

#shortest-path

Real questions. Useful conversations. Find the people who know your stack.

Article0 replies2,983 followingPosted 30 Jul 2025, 18:27 UTC28.8K views2,488 votes

Weighted shortest paths in NetworkX: Dijkstra, edge weights, and verification

Use NetworkX Dijkstra with non-negative edge weights, verify by summing attributes, and know when BFS or Bellman-Ford is the better choice.

Community & Careers · Blog

Tasadduq Burneyowner

Started30 Jul 2025, 18:27 UTC

Level 38Owner35,275 rep points

Community & Careers

Article0 replies1,620 followingPosted 28 Apr 2026, 14:18 UTC119.5K views1,459 votes

Choosing a NetworkX Shortest-Path Routine for Weighted and Unweighted Graphs

Choosing the right NetworkX shortest-path routine depends on edge weights and query shape. Compare Dijkstra, Bellman-Ford, Floyd-Warshall, and BFS trade-offs, then validate the result with a recomputed path cost.

Community & Careers · Guide

python graph-algorithms shortest-path

Community & Careers

Article0 replies3,972 followingPosted 19 Feb 2026, 03:06 UTC23.3K views2,412 votes

Choosing BFS for Shortest Path Grid Problems on LeetCode: A Decision Guide

When solving LeetCode grid puzzles that ask for the shortest route, BFS is usually the right tool. This guide compares BFS, DFS, and A* in a compact table, explains trade‑offs, and shows a Java 17 implementation you can copy‑paste into the LeetCode editor.

Community & Careers · Guide

bfs

leetcode shortest-path

Community & Careers

Article0 replies3,104 followingPosted 02 Mar 2026, 15:52 UTC129.5K views4,514 votes

Finding Weighted Shortest Paths in NetworkX with Dijkstra's Algorithm

Learn how to use NetworkX's shortest_path function with Dijkstra's algorithm to find weighted shortest paths, including a code example, limits, and common pitfalls.

Community & Careers · Guide

dijkstra graph-algorithms shortest-path

Community & Careers

Article0 replies4,071 followingPosted 20 Sept 2025, 06:49 UTC122.1K views4,341 votes

Dijkstra in NetworkX: Shortest Paths and Practical Limits

NetworkX wraps Dijkstra’s algorithm for single‑source shortest paths, but disconnected nodes, attribute propagation, and graph density can trip up unwary users. This post covers the gotchas and a verification routine.

Community & Careers · Blog

networkx-dijkstra graph-density shortest-path

Community & Careers

Article0 replies2,373 followingPosted 16 Feb 2026, 14:31 UTC132.8K views3,435 votes

Choosing the Right Shortest‑Path Algorithm in NetworkX: Dijkstra, Bellman‑Ford, or A*

Learn how to pick the right shortest‑path algorithm in NetworkX – Dijkstra, Bellman‑Ford, or A* – with a clear example, performance tips, and common pitfalls to avoid in production.

Community & Careers · Guide

python shortest-path graph-theory