Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES

## Package de.jstacs.algorithms.graphs

Provides classes for algorithms on graphs.

See:
Description

Class Summary
Chu_Liu_Edmonds | This class implements the algorithm of Chu_Liu_Edmonds to determine an optimal branching (optimal directed graph of order 1).
DAG | This is the main class of the graph library.
Edge | This class is a representation of a weighted edge.
MST | This class enables you to compute the maximal spanning forest for an undirected, weighted graph.
TopSort | Class for a topological sort.
UnionFind | This class implements an Union-Find-algorithm with path contraction.

## Package de.jstacs.algorithms.graphs Description

Provides classes for algorithms on graphs. This includes maximum spanning trees of directed and undirected weighted graphs.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES