BestHub
Sign in
Tagged articles
9 articles
Page 1 of 1
Data Party THU
Data Party THU
Aug 25, 2025 · Industry Insights

Can a New Algorithm Really Beat Dijkstra? Inside the Breakthrough Shortest‑Path Method

A new shortest‑path algorithm developed by researchers at Tsinghua University claims to overcome the long‑standing sorting bottleneck of Dijkstra’s classic method, extending to both undirected and directed graphs and sparking fresh debate on algorithmic optimality and future research directions.

Computational ComplexityDijkstraalgorithm breakthrough
0 likes · 10 min read
Can a New Algorithm Really Beat Dijkstra? Inside the Breakthrough Shortest‑Path Method
Model Perspective
Model Perspective
Mar 23, 2023 · Fundamentals

Mastering Shortest Path Algorithms: Theory, Models, and Python NetworkX Example

This article explains the shortest path problem in graph theory, presents its integer linear programming model, reviews classic algorithms such as Dijkstra, Bellman‑Ford, and Floyd‑Warshall, and demonstrates solving a city‑flight cost example using Python’s NetworkX library with code snippets.

DijkstraLinear Programminggraph algorithms
0 likes · 7 min read
Mastering Shortest Path Algorithms: Theory, Models, and Python NetworkX Example
Model Perspective
Model Perspective
Mar 8, 2023 · Fundamentals

Dynamic Programming Demystified: Python Knapsack & Shortest Path

This article introduces the core concepts of dynamic programming, explains its principles of breaking problems into subproblems with optimal substructure, and provides step‑by‑step Python implementations for the classic knapsack optimization and a shortest‑path graph algorithm, complete with illustrative code and visualizations.

algorithmdynamic programmingknapsack
0 likes · 10 min read
Dynamic Programming Demystified: Python Knapsack & Shortest Path
Model Perspective
Model Perspective
Aug 20, 2022 · Fundamentals

Unlock SciPy’s Sparse Graph Algorithms: Shortest Paths, MSTs & More

This article lists the key SciPy sparse‑graph functions—such as connected components, Laplacian, various shortest‑path algorithms, traversals, minimum spanning tree, flow and matching utilities—and provides Python code examples demonstrating their use.

Pythongraph algorithmsminimum spanning tree
0 likes · 4 min read
Unlock SciPy’s Sparse Graph Algorithms: Shortest Paths, MSTs & More
Intelligent Backend & Architecture
Intelligent Backend & Architecture
May 14, 2021 · Fundamentals

Master Hash Tables, Heaps, and Graph Algorithms: From Basics to Dijkstra

This article introduces core data structures—hash tables, heaps, and graphs—explains their definitions, visual representations, and key operations, then delves into fundamental graph algorithms such as BFS, Dijkstra, Floyd, minimum spanning trees, and topological sorting, illustrating each with examples and code.

Data StructuresDijkstraHeap
0 likes · 16 min read
Master Hash Tables, Heaps, and Graph Algorithms: From Basics to Dijkstra
Programmer DD
Programmer DD
Sep 27, 2018 · Fundamentals

Building a Shanghai Metro Transfer Planner with Dijkstra’s Algorithm

This article explains how to fetch Shanghai Metro data, model stations and lines as a graph, apply Dijkstra’s algorithm with a bias for transfers, and implement a practical transfer‑planning tool that outputs realistic routes rather than just shortest‑distance counts.

DijkstraGraph AlgorithmMetro Planning
0 likes · 10 min read
Building a Shanghai Metro Transfer Planner with Dijkstra’s Algorithm