procedure SortWays(const Table:tTable;Var Routs:TArrOfRoutes);
var
  i,j:integer;
  Top,NextTop:integer;
  ValRouts:array of integer;
  tmpRout:string;
  tmpVal:integer;
  NumLet:integer;
begin
  SetLength(ValRouts,Length(Routs));
  for I := 0 to length(ValRouts)-1 do
    ValRouts[i]:=0;
  for I := 0 to Length(Routs)-1 do
    if (Routs[i]<>'') and (length(Routs[i])>=2) then
    begin
      NumLet:=1;
      while (NumLet+1)<=length(Routs[i]) do
      begin
        Top:=StrToInt(Routs[i,NumLet]);
        NextTop:=StrToInt(Routs[i,NumLet+1]);
        ValRouts[i]:=ValRouts[i]+Table[Top,NextTop];
        inc(NumLet);
      end;
    end;
  for i :=0 to Length(Routs)-2 do
    for j :=0 to Length(Routs)-i-2 do
    if (ValRouts[j]>ValRouts[j+1]) then
    begin
      tmpVal:=ValRouts[j];
      ValRouts[j]:=ValRouts[j+1];
      ValRouts[j+1]:=tmpVal;
      tmpRout:=Routs[j];
      Routs[j]:=Routs[j+1];
      Routs[j+1]:=tmpRout;
    end;
end;