public class Dijkstra extends Object
Modifier and Type | Field and Description |
---|---|
static Double |
NOT_COMPUTED |
Constructor and Description |
---|
Dijkstra(slib.sglib.model.graph.G g,
slib.sglib.model.graph.utils.WalkConstraint walconstraints)
Edge weights set to 1
|
Dijkstra(slib.sglib.model.graph.G g,
slib.sglib.model.graph.utils.WalkConstraint walconstraints,
slib.sglib.model.graph.weight.GWS weightingScheme)
Create an Dijkstra algorithm used to compute shortest paths on a graph
considering a given non negative weighting scheme
|
Modifier and Type | Method and Description |
---|---|
ConcurrentHashMap<org.openrdf.model.URI,Double> |
shortestPath(org.openrdf.model.URI source) |
Double |
shortestPath(org.openrdf.model.URI source,
org.openrdf.model.URI t)
Compute shortest path between two nodes Note also that the resultStack is
populated during computation
|
public static final Double NOT_COMPUTED
public Dijkstra(slib.sglib.model.graph.G g, slib.sglib.model.graph.utils.WalkConstraint walconstraints) throws slib.utils.ex.SLIB_Ex_Critic
g
- walconstraints
- slib.utils.ex.SLIB_Ex_Critic
public Dijkstra(slib.sglib.model.graph.G g, slib.sglib.model.graph.utils.WalkConstraint walconstraints, slib.sglib.model.graph.weight.GWS weightingScheme) throws slib.utils.ex.SLIB_Ex_Critic
g
- the graph on which the shortest path has to be computedwalconstraints
- the constraint associated to the searchweightingScheme
- aslib.utils.ex.SLIB_Ex_Critic
public Double shortestPath(org.openrdf.model.URI source, org.openrdf.model.URI t)
source
- t
- public ConcurrentHashMap<org.openrdf.model.URI,Double> shortestPath(org.openrdf.model.URI source)
source
- Copyright © 2014. All rights reserved.