TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask HN: What is an algorithm for making the an efficient network between points?

2 点作者 b_b大约 6 年前
I was looking at slime mold recently [0][1] and thought that it&#x27;d be cool to try and test its network mapping capabilities against that of a human designed algorithm, and see how they differ. Problem is, I don&#x27;t know much about algorithms, and whether one for creating networks with loops even exist. I know HN has some amazing programmers here so I was wondering if someone here knew.<p>[0] = https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=Nx3Uu1hfl6Q [1] = https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=2UxGrde1NDA

1 comment

wmf大约 6 年前
<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Steiner_tree_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Steiner_tree_problem</a> ?