Tagged articles
Shortest Path
13 articles · Page 1 of 1
This article provides a comprehensive solution to LeetCode 675 'Cut Off Trees for Golf Event', detailing BFS, A* heuristic search, and Union-Find pre-processing for unreachable cases, with full Java implementations and complexity analysis.
A* SearchAlgorithmBFS
0 likes · 21 min read

The article shares a career anecdote about a failed background check due to an omitted 5-day job, then provides a comprehensive solution to LeetCode 675 'Cut Off Trees for Golf Event' using BFS, A* search with Manhattan heuristic, and Union-Find pre-check for unreachable trees.
A*AlgorithmBFS
0 likes · 20 min read

This article reviews two SIGMOD 2026 papers—MASC, which redefines multi‑query subgraph matching by maximizing shared computation to achieve up to two orders of magnitude speedup, and PrivHop, which combines 2‑hop labeling with secure multi‑party computation to enable privacy‑preserving shortest‑path queries on million‑node graphs with roughly a million‑fold reduction in runtime and communication.
Graph AlgorithmsMPCShortest Path
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 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 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 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.
AlgorithmShortest Pathdynamic programming
0 likes · 10 min read

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.
Graph AlgorithmsPythonShortest Path
0 likes · 4 min read

This guide walks you through installing NetworkX, creating weighted undirected graphs, visualizing them with various layouts, computing shortest paths using Dijkstra, and generating minimum spanning trees, all with clear Python code examples.
PythonShortest Pathgraph theory
0 likes · 6 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
