INSA/be-graphes
3
0
Fork 0
Code Issues 4 Releases Wiki Activity

Epsilon changes.

Browse Source
This commit is contained in:
Didier Le Botlan 2024-06-03 15:06:07 +02:00
parent 32f99dba49
commit 32e5ffb462
2 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
be-graphes-algos/src/main/java/org/insa/graphs/algorithm/ArcInspectorFactory.java
View File

@ -81,7 +81,7 @@ public class ArcInspectorFactory {
@Override @Override
public boolean isAllowed(Arc arc) { public boolean isAllowed(Arc arc) {
return true; return forCarsL.isAllowed(arc) ;
} }
@Override @Override
@ -108,7 +108,7 @@ public class ArcInspectorFactory {
} ; } ;
// Non-private roads for pedestrian and bicycle: // Non-private roads for pedestrian and bicycle:
static ArcInspector forBicyclesT = new ArcInspector() { static ArcInspector forPedestrianT = new ArcInspector() {
static final int maxPedestrianSpeed = 5 ; static final int maxPedestrianSpeed = 5 ;
@ -155,7 +155,7 @@ public class ArcInspectorFactory {
filters.add(allArcsL) ; filters.add(allArcsL) ;
filters.add(forCarsL) ; filters.add(forCarsL) ;
filters.add(forCarsT) ; filters.add(forCarsT) ;
filters.add(forBicyclesT); filters.add(forPedestrianT);
// Add your own filters here (do not forget to implement toString() // Add your own filters here (do not forget to implement toString()
// to get an understandable output!): // to get an understandable output!):

3
be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
View File

@ -8,7 +8,10 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
@Override @Override
protected ShortestPathSolution doRun() { protected ShortestPathSolution doRun() {
// First step: get data from the input problem.
// The getInputData method is inherited from parent class ShortestPathAlgorithm
final ShortestPathData data = getInputData(); final ShortestPathData data = getInputData();
ShortestPathSolution solution = null; ShortestPathSolution solution = null;
// TODO: // TODO:
return solution; return solution;