TreeToPathDecompositionAlgorithm.PathDecomposition (JGraphT : a free Java graph library)

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Known Implementing Classes:

TreeToPathDecompositionAlgorithm.PathDecompositionImpl

Enclosing interface:

TreeToPathDecompositionAlgorithm<V,E>
```
public static interface TreeToPathDecompositionAlgorithm.PathDecomposition<V,E>
```
A path decomposition.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`java.util.Set<E>`	`getEdges()`	Set of edges of the path decomposition.
`java.util.Set<GraphPath<V,E>>`	`getPaths()`	Set of disjoint paths of the decomposition
`default int`	`numberOfPaths()`

- Method Detail
  - getEdges
```
java.util.Set<E> getEdges()
```
    Set of edges of the path decomposition.
    
    Returns:
    
    edge set of the path decomposition
  - getPaths
```
java.util.Set<GraphPath<V,E>> getPaths()
```
    Set of disjoint paths of the decomposition
    
    Returns:
    
    list of vertex paths
  - numberOfPaths
```
default int numberOfPaths()
```
    Returns:
    
    number of paths in the decomposition