Tagged articles
Dijkstra
15 articles · Page 1 of 1
This article explains PV operations (semaphores) using traffic light analogies, covering P/V definitions, mutual exclusion, synchronization, resource counting, the producer-consumer problem with complete code walkthrough, and critical pitfalls like deadlock from incorrect P-ordering.
DijkstraPV operationsProducer-Consumer
0 likes · 11 min read

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.
DijkstraRisk Assessmentformal verification
0 likes · 17 min read

The article revisits Dijkstra's 1977 critique of natural language programming, arguing that formal symbols are essential for precise computation, and questions whether modern AI code agents can truly bridge the gap between ambiguous natural language and rigorous formal systems without reintroducing the same problems.
DijkstraNatural Language ProgrammingVibe Coding
0 likes · 5 min read

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.
DijkstraGraph AlgorithmsShortest Path
0 likes · 10 min read

This article presents the LeetCode 1514 'Maximum Probability Path' problem, explains the algorithm using a priority‑queue approach, provides full Java and C++ implementations, and concludes with a promotional book giveaway encouraging readers to follow the public account.
DijkstraGraphLeetCode
0 likes · 8 min read

This article presents LeetCode problem 1514, which asks for the path with the highest success probability in an undirected weighted graph, explains the problem statement, constraints, and provides detailed Java and C++ implementations using a priority‑queue based Dijkstra‑like algorithm.
DijkstraGraphLeetCode
0 likes · 7 min read

This article walks through the design of an intelligent travel‑planning system that uses Dijkstra’s algorithm to compute the minimum travel cost to each city while maximizing the number of cities visited, detailing problem formulation, algorithmic steps, variable initialization, edge‑relaxation logic, and a full Python implementation.
DijkstraPythonShortest Path
0 likes · 18 min read

This article walks through the problem of finding the shortest route in a smart‑traffic graph, explains Dijkstra's greedy algorithm step by step, illustrates the process with a narrative example, and provides complete Python code using heapq for priority‑queue management.
DijkstraGraph AlgorithmsHeapq
0 likes · 30 min read

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.
DijkstraGraph AlgorithmsLinear Programming
0 likes · 7 min read

This article introduces the classic shortest‑path problem in graph theory, explains major algorithms such as Dijkstra, Bellman‑Ford, Floyd and A*, discusses their strengths and limitations, and demonstrates their application to a city‑ticket pricing case using Python’s NetworkX library.
A*Bellman-FordDijkstra
0 likes · 6 min read

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.
DijkstraGraph AlgorithmsHeap
0 likes · 16 min read

This article introduces core data structures—hash tables, heaps, and graphs—explains their definitions, typical applications, and key algorithms such as shortest‑path (BFS, Dijkstra, Floyd), minimum spanning tree (Prim, Kruskal), and topological sorting, and provides a complete Java implementation of Dijkstra.
DijkstraGraphHeap
0 likes · 16 min read

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.
DijkstraMetro PlanningPython
0 likes · 10 min read

This article explains how Baidu Maps introduced a dedicated cycling navigation service in 2015, compares traditional A* routing with the innovative High Dijkstra (HD) algorithm, and details the three development sprints that dramatically improved route optimality and performance for cyclists.
DijkstraGraph AlgorithmsRouting
0 likes · 9 min read

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.
AlgorithmsDijkstraHuffman coding
0 likes · 19 min read
