favary/BE_graphes
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

milieu séance

Browse source
This commit is contained in:
Favary Pierre 2021-03-31 16:56:49 +02:00
parent 8ab68ac6e7
commit 93fbf88d99
1 changed files with 42 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

53
be-graphes-model/src/main/java/org/insa/graphs/model/Path.java
View file

@ -51,12 +51,34 @@ public class Path {
* @throws IllegalArgumentException If the list of nodes is not valid, i.e. two
* consecutive nodes in the list are not connected in the graph.
*
* @deprecated Need to be implemented.
*/
public static Path createShortestPathFromNodes(Graph graph, List<Node> nodes)
throws IllegalArgumentException {
List<Arc> arcs = new ArrayList<Arc>();
// TODO:
boolean suiv;
Arc bonarc;
for (int i=0;i<nodes.size()-1;i++) {
if (nodes.get(i).getNumberOfSuccessors()<=0)
throw new IllegalArgumentException();
bonarc=Node.linkNodes(null, null, Float.MAX_VALUE, null, null);
for (int parcourt=0; parcourt<nodes.get(i).getNumberOfSuccessors(); parcourt++) {
suiv=false;
if (nodes.get(i).getSuccessors().get(parcourt).getDestination()==nodes.get(i+1)) {
if (nodes.get(i).getSuccessors().get(parcourt).getLength()<bonarc.getLength()) {
bonarc=nodes.get(i).getSuccessors().get(parcourt);
suiv=true;
}
}
if (!suiv)
throw new IllegalArgumentException();
}
arcs.add(bonarc);
}
return new Path(graph, arcs);
}
@ -198,11 +220,20 @@ public class Path {
*
* @return true if the path is valid, false otherwise.
*
* @deprecated Need to be implemented.
*/
public boolean isValid() {
// TODO:
return false;
boolean bool=true;
if (!this.isEmpty() && !this.arcs.isEmpty()) {
if (this.origin!=this.arcs.get(0).getOrigin())
bool=false;
else if (this.arcs.size()>1) {
for (int i=0;i<this.arcs.size()-1;i++) {
if (this.arcs.get(i).getDestination()!=this.arcs.get(i+1).getOrigin())
bool=false;
}
}
}
return bool;
}
/**
@ -227,11 +258,9 @@ public class Path {
* @return Time (in seconds) required to travel this path at the given speed (in
* kilometers-per-hour).
*
* @deprecated Need to be implemented.
*/
public double getTravelTime(double speed) {
// TODO:
return 0;
return this.getLength()*3.6/speed;
}
/**
@ -240,11 +269,13 @@ public class Path {
*
* @return Minimum travel time to travel this path (in seconds).
*
* @deprecated Need to be implemented.
*/
public double getMinimumTravelTime() {
// TODO:
return 0;
double temps=0.0;
for (int i=0;i<this.arcs.size();i++) {
temps+=this.arcs.get(i).getMinimumTravelTime();
}
return temps;
}
}