frero-uni/TDT4165
0
0
Fork 0
Code Issues Pull Requests Releases Activity

ex5/2.2: use sort instead of manual recursion

Browse Source
This commit is contained in:
Fredrik Robertsen
2025-11-05 09:52:31 +01:00
parent 000e6c99c7
commit d6bbb506e6
1 changed files with 2 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
assignment5/main.pl
View File

@@ -49,15 +49,6 @@ plan(Cabin1, Cabin2, Visited, Path, TotalDistance) :-
bestplan(Cabin1, Cabin2, ShortestPath, ShortestDistance) :-
findall([Path, Distance], (plan(Cabin1, Cabin2, Path, Distance)), Solutions),
shortestpath(Solutions, [ShortestPath, ShortestDistance]).
% takes a list of [Path Distance] pairs
shortestpath([[Path, Distance]|[]], Solution) :- Solution = [Path, Distance].
shortestpath([[Path, Distance]|Tail], [ShortestPath, ShortestDistance]) :-
shortestpath(Tail, [TailPath, TailDistance]),
(Distance < TailDistance ->
(ShortestPath = Path, ShortestDistance = Distance)
;
(ShortestPath = TailPath, ShortestDistance = TailDistance)
).
sort(2, @=<, Solutions, [ShortestSolution|_]),
[ShortestPath, ShortestDistance] = ShortestSolution.