1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
/*
* Copyright (c) 2003, the JUNG Project and the Regents of the University
* of California
* All rights reserved.
*
* This software is open-source under the BSD license; see either
* "license.txt" or
* http://jung.sourceforge.net/license.txt for a description.
*
* Created on Feb 12, 2004
*/
package edu.uci.ics.jung.algorithms.shortestpath;
import java.util.Map;
/**
* An interface for algorithms that calculate shortest paths.
*/
public interface ShortestPath<V, E>
{
/**
* <p>Returns a <code>Map</code> which maps each vertex
* in the graph (including the <code>source</code> vertex)
* to the last edge on the shortest path from the
* <code>source</code> vertex.
*/
Map<V,E> getIncomingEdgeMap(V source);
}
|
