Published November 6, 2025 | Version 1.0
Preprint Open

A Structural Complexity Heuristic for Admissible Shortest Path Optimization HFP-A*

Description

Optimizing Dijkstra: A Parallel Hybrid Model Using a Prime Factor Heuristic (HFP) for Admissible Acceleration

Dijkstra's algorithm provides an optimal solution to the Shortest Path Problem (SPP) but relies on a "blind" search strategy. We introduce a new, non-geometric heuristic class, the HFP (Heuristic of Prime Factors), which guides an A* search based on the structural complexity of nodes, defined by the number of their distinct prime factors ω(n)≠2

We demonstrate that this heuristic's correlation with the optimal path is an emergent property that appears only in graphs of sufficient complexity. However, our key finding is that the HFP heuristic is not infallible. Our batch tests revealed "landmine" scenarios (approx. 10-20% of cases) where the heuristic is catastrophically misleading, causing the A* search to explore more steps than a blind Dijkstra (e.g., 6,425 steps vs. 1,533).

Therefore, a "naive" HFP-A* implementation is unreliable. We propose a Parallel Hybrid Algorithm as the only robust and admissible solution. This algorithm runs a "blind" Dijkstra on one thread and our "guided" HFP-A* on another. The first thread to find the solution "wins" (terminates the other).

This hybrid model is 100% precise (it is mathematically impossible for it to be slower than standard Dijkstra) and wins the race 70-80% of the time, leveraging the HFP heuristic's 21.54% average step reduction in its winning cases. This method provides a reliable framework for achieving significant, real-world computational savings.

Andrés Sebastián Pirolo 2025

feedback: apirolo@abc.gob.ar

 

Other articles by the author

The Consistency Peak Principle - Geometric Identification of the Chromatic Number via 3D Riemann-Vortex Mapping

https://zenodo.org/records/17403219

A Geometric Anomaly Detection Method for Locating Large Mersenne Prime Candidates

https://zenodo.org/records/17267849

The Signature of Chaos

https://zenodo.org/records/17239094

Zero-Vortex: A Geo-Arithmetic Paradigm for the Yang-Mills Mass Gap

https://zenodo.org/records/17204948

The Sigma-Displacement Law: A Geometric Proof of the Riemann Hypothesis

https://zenodo.org/records/17096978

Universal Geometric Signatures in 3-SAT

https://zenodo.org/records/17412980

A Geo-Arithmetic Duality: The Pirolo Vortex and a Computational Criterion for Algebraic Cycles

https://zenodo.org/records/17156451

Contact: apirolo@abc.gob.ar

Files

Pirolo Shortest path_10.pdf

Files (947.3 kB)

Name Size Download all
md5:3690866e6f504a65a37431a3306f6f3e
947.3 kB Preview Download