The WormHole Algorithm for Approximate Shortest Paths in Large Graphs
Hausdorff通过数学揭示了距离与维度中的美感，展现了自相似的奇妙世界。 2025-10-15 15:0:4 Author: hackernoon.com(查看原文) 阅读量:6 收藏

New Story

by

byHausdorff@hausdorff

Hausdorff's math unveils the beauty in distance and dimension, a world of self-similar wonder.

October 15th, 2025

featured image - The WormHole Algorithm for Approximate Shortest Paths in Large Graphs

Audio Presented by

    Speed

Hausdorff

byHausdorff@hausdorff

    byHausdorff@hausdorff

    Hausdorff's math unveils the beauty in distance and dimension, a world of self-similar wonder.

    Story's Credibility

    Academic Research Paper

Hausdorff

    byHausdorff@hausdorff

    Hausdorff's math unveils the beauty in distance and dimension, a world of self-similar wonder.

    Story's Credibility

    Academic Research Paper

About Author

Hausdorff HackerNoon profile picture

Hausdorff's math unveils the beauty in distance and dimension, a world of self-similar wonder.

Comments

avatar

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories


文章来源: https://hackernoon.com/the-wormhole-algorithm-for-approximate-shortest-paths-in-large-graphs?source=rss
如有侵权请联系:admin#unsafe.sh