com.savarese.algorithms.graph
Interface SingleSourcePathFinder<V,W,E extends Edge<V,W>>

All Known Implementing Classes:

DijkstraShortestPathFinder

public interface SingleSourcePathFinder<V,W,E extends Edge<V,W>>

A SingleSourcePathFinder is a path finding algorithm that finds paths between a single source and one or more destinations meeting some criteria (e.g., shortest path).

Author:

Daniel F. Savarese

Method Summary

SingleSourcePath<V,W>

findPath(Graph<V,E> graph, V source) Finds one or more paths betwen the source vertex and one or more destinations in the given graph.

Method Detail

findPath

SingleSourcePath<V,W> findPath(Graph<V,E> graph,
                               V source)

Finds one or more paths betwen the source vertex and one or more destinations in the given graph.

Parameters:

graph - The graph to be searched.

source - The source vertex from which all paths will emanate.

Returns:

The paths found.