Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## edu.uci.ics.jung.algorithms.shortestpath
Interface ShortestPath

All Known Implementing Classes:
  DijkstraShortestPath, UnweightedShortestPath

public interface ShortestPath

Author:
  Joshua O'Madadhain

Method Summary
`Map` | `getIncomingEdgeMap(Vertex source)` Returns a `LinkedHashMap` which maps each vertex in the graph (including the `source` vertex) to the last edge on the shortest path from the `source` vertex.

Method Detail

### getIncomingEdgeMap

    public Map getIncomingEdgeMap(Vertex source)

  Returns a `LinkedHashMap` which maps each vertex in the graph (including the `source` vertex) to the last edge on the shortest path from the `source` vertex.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD