mjwach / two-steiner-tree-algorithms-in-java Public

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.

BSL-1.0 and 3 other licenses found

5 stars 2 forks Branches Tags Activity

Notifications

Error
Looks like something went wrong!

About

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.

java graph-algorithms steiner-tree steiner-tree-problem

BSL-1.0 and 3 other licenses found

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 100.0%