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

## Package edu.uci.ics.jung.algorithms.connectivity

Provides a series of methods for computing various aspects of a graph's overall connectivity structure.

See:
Description

Class Summary
BFSDistanceLabeler | Labels each node in the graph according to the BFS distance from the start node(s).
KNeighborhoodExtractor | Extracts the subgraph (neighborhood) from a graph whose nodes are no more than distance k away from at least one of the root nodes (starting vertices).

## Package edu.uci.ics.jung.algorithms.connectivity Description

Provides a series of methods for computing various aspects of a graph's overall connectivity structure.

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