BestHub
Sign in
Tagged articles
11 articles
Page 1 of 1
FunTester
FunTester
Apr 9, 2026 · Fundamentals

Why Passing Tests Aren’t Proof of Correctness: Dijkstra’s Insight & Modern Strategies

The article explains that a green test run only shows the absence of detected bugs under specific inputs, environments, and assumptions, explores the asymmetry between verification and falsification, discusses the test‑oracle problem, property‑based testing, formal verification, and proposes a risk‑calibrated testing approach.

DijkstraSoftware Testingformal verification
0 likes · 17 min read
Why Passing Tests Aren’t Proof of Correctness: Dijkstra’s Insight & Modern Strategies
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
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
Qunar Tech Salon
Qunar Tech Salon
Dec 5, 2015 · Fundamentals

Why Learning Data Structures and Algorithms Makes You a Better Developer

This article explains how mastering data structures and algorithm analysis provides a problem‑solving mindset, covering fundamental concepts, Dijkstra’s shortest‑path algorithm, topological sorting for dependency resolution, and Huffman coding for data compression, illustrating their broad impact on software development.

AlgorithmsData StructuresDijkstra
0 likes · 19 min read
Why Learning Data Structures and Algorithms Makes You a Better Developer