V - the graph vertex typeE - the graph edge typepublic interface PathValidator<V,E>
KShortestSimplePaths - that the path is from source to target and that it does not
 contain loops.| Modifier and Type | Method and Description | 
|---|---|
| boolean | isValidPath(GraphPath<V,E> partialPath,
           E edge)Checks if an edge can be added to a previous path element. | 
boolean isValidPath(GraphPath<V,E> partialPath, E edge)
partialPath - the path from source vertex up to the current vertex.edge - the new edge to be added to the path.true if edge can be added, false otherwise.Copyright © 2019. All rights reserved.