-
Notifications
You must be signed in to change notification settings - Fork 10
/
ShortestPathAlgorithmSelector.java
53 lines (47 loc) · 1.87 KB
/
ShortestPathAlgorithmSelector.java
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package org.apache.commons.graph.shortestpath;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
import org.apache.commons.graph.WeightedPath;
import org.apache.commons.graph.weight.OrderedMonoid;
/**
*
*
* @param <V> the Graph vertices type.
* @param <WE> the Graph weighted edges type
* @param <W> the weight type
*/
public interface ShortestPathAlgorithmSelector<V, WE, W>
{
/**
* Calculates the shortest path using the A* algorithm.
*
* @param <WO> the type of weight operations
* @param weightOperations the class responsible for operations on weights
* @return
*/
<WO extends OrderedMonoid<W>> HeuristicBuilder<V, WE, W> applyingAStar( WO weightOperations );
/**
* Calculates the shortest path using Dijkstra's algorithm.
*
* @param <WO> the type of weight operations
* @param weightOperations the class responsible for operations on weights
* @return a path which describes the shortest path, if any, otherwise a {@link PathNotFoundException} will be thrown
*/
<WO extends OrderedMonoid<W>> WeightedPath<V, WE, W> applyingDijkstra( WO weightOperations );
}