CVS difference for ai05s/ai05-0212-1.txt
--- ai05s/ai05-0212-1.txt 2011/10/21 06:42:22 1.18
+++ ai05s/ai05-0212-1.txt 2011/11/01 05:32:53 1.19
@@ -2133,10 +2133,10 @@
Nearest_Distance : Distance;
Next : Node;
@b<begin>
- Reached (Source) := True;
+ Reached(Source) := True;
So_Far (Source) := 0.0;>
-@xcode< @b<while not> Reached (Target) @b<loop>
+@xcode< @b<while not> Reached(Target) @b<loop>
Nearest_Distance := Distance'Last;>
@xcode< -- @i<@ft<Find closest node not reached yet, by iterating over all nodes.>>
@@ -2144,7 +2144,7 @@
@xcode< Next := Source;
@b<for> N @b<in> Node'First .. Node'Last @b<loop>
- @b<if not> Reached (N)
+ @b<if not> Reached(N)
@b<and then> So_Far (N) < Nearest_Distance @b<then>
Next := N;
Nearest_Distance := So_Far (N);
@@ -2155,13 +2155,13 @@
@b<return> Paths.Empty_List;>
@xcode< @b<else>
- Reached (Next) := True;
+ Reached(Next) := True;
@b<end if>;>
@xcode< -- @i<@ft<Update minimum distance to newly reachable nodes.>>>
@xcode< @b<for> E @b<of> G (Next) @b<loop>
- @b<if not> Reached (E.To) @b<then>
+ @b<if not> Reached(E.To) @b<then>
Nearest_Distance :=
Distance'Min (So_Far (E.To) + So_Far (Next),
So_Far (E.To));>
@@ -2202,7 +2202,7 @@
Similarly, the effect of the loop:
@xcode<@b<for> E @b<of> G (Next) @b<loop>
- @b<if not> Reached (E.To) @b<then>
+ @b<if not> Reached(E.To) @b<then>
...
@b<end if>;
@b<end loop>;>
@@ -2213,7 +2213,7 @@
@b<declare>
E : Edge @b<renames> G (Next)(C).@b<all>;
@b<begin>
- @b<if not> Reached (E.To) @b<then>
+ @b<if not> Reached(E.To) @b<then>
...
@b<end if>;
@b<end>;
@@ -2229,7 +2229,7 @@
@b<declare>
E : Edge @b<renames> L(C).@b<all>;
@b<begin>
- @b<if not> Reached (E.To) @b<then>
+ @b<if not> Reached(E.To) @b<then>
...
@b<end if>;
@b<end>;
Questions? Ask the ACAA Technical Agent