jung-algorithms

library2.1.1javamavenunverified

Algorithms module for the Java Universal Network/Graph framework, providing graph analysis and traversal algorithms.

<dependency>
  <groupId>net.sf.jung</groupId>
  <artifactId>jung-algorithms</artifactId>
  <version>2.1.1</version>
</dependency>

github ↗homepage ↗docs ↗

INSTALL

IMPORT

SIG · JUNG-ALGORITHMS

jung-algorithms

utilityjavav2.1.1

harness data pending

Install & Compatibility

Where this runs

No compatibility data collected yet for this library.

Code

Verified usage

Verified import paths — ran on the pinned version, not inferred.

DijkstraShortestPath

✓ edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath

Computes shortest path distances in a graph using Dijkstra's algorithm.

import edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath; import edu.uci.ics.jung.graph.Graph; import edu.uci.ics.jung.graph.SparseGraph; public class Example { public static void main(String[] args) { Graph<Integer, String> g = new SparseGraph<>(); g.addEdge("e1", 1, 2); DijkstraShortestPath<Integer, String> alg = new DijkstraShortestPath<>(g); System.out.println(alg.getDistance(1, 2)); } }

Debug

Known issues

No known issues recorded.

Upgrade

Version history

2.1.1latest on Maven

Audit

Dependencies

No dependency data recorded yet.

Agent activity

2 hits · last 30 days

node

Resources

githubhttps://github.com/jrtom/jung ↗

homepagehttp://jrtom.github.io/jung/ ↗

docshttps://appdoc.app/artifact/net.sf.jung/jung-algorithms/ ↗