M
Mikhail Kovalev
Was hoping someone can help me, does anyone know what programming
language this looks like:
@p @t\4@>@<Declare the procedure called |solve_choices|@>@;
procedure make_choices(@!knotsointer);
label done;
var @!hointer; {the first breakpoint}
@!p,@!qointer; {consecutive breakpoints being processed}
@<Other local variables for |make_choices|@>@;
begin check_arith; {make sure that |arith_error=false|}
if internal[tracing_choices]>0 then
print_path(knots,", before choices",true);
@<If consecutive knots are equal, join them explicitly@>;
@<Find the first breakpoint, |h|, on the path;
insert an artificial breakpoint if the path is an unbroken cycle@>;
p:=h;
repeat @<Fill in the control points between |p| and the next
breakpoint,
then advance |p| to that breakpoint@>;
until p=h;
if internal[tracing_choices]>0 then
print_path(knots,", after choices",true);
if arith_error then @<Report an unexpected problem during the choice-
making@>;
end;
Thanks!=)
language this looks like:
@p @t\4@>@<Declare the procedure called |solve_choices|@>@;
procedure make_choices(@!knotsointer);
label done;
var @!hointer; {the first breakpoint}
@!p,@!qointer; {consecutive breakpoints being processed}
@<Other local variables for |make_choices|@>@;
begin check_arith; {make sure that |arith_error=false|}
if internal[tracing_choices]>0 then
print_path(knots,", before choices",true);
@<If consecutive knots are equal, join them explicitly@>;
@<Find the first breakpoint, |h|, on the path;
insert an artificial breakpoint if the path is an unbroken cycle@>;
p:=h;
repeat @<Fill in the control points between |p| and the next
breakpoint,
then advance |p| to that breakpoint@>;
until p=h;
if internal[tracing_choices]>0 then
print_path(knots,", after choices",true);
if arith_error then @<Report an unexpected problem during the choice-
making@>;
end;
Thanks!=)