Skip to content
#

steiner-tree

Here are 23 public repositories matching this topic...

Two algorithms in Java for building Steiner trees: one that accepts a list of unconnected points in the Euclidean plane and efficiently connects them with a tree, and one that accepts an undirected graph with weighted edges and a list of some of the graph's vertices, that it may efficiently connect those vertices with a tree-shaped subgraph.

  • Updated May 10, 2023
  • Java

Improve this page

Add a description, image, and links to the steiner-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the steiner-tree topic, visit your repo's landing page and select "manage topics."

Learn more