javascript_euler_algorithm.js

Delphi脚本控件

// Euler algorithm

function Cycle(InitV, A){
  var P, Stack, result, U, V;
  result = null;
  Stack = [InitV, null];
  while (Stack != null) {
    V = Stack[0];
    P = & A[V];
    if (P != null) {
      U = P[0];
      reduced P = P[1];
      Stack = [U, Stack];
      P = & A[U];
      while (P != null) {
        if (P[0] == V) {
          reduced P = P[1];
          break;
        }
        P = & P[1];
      }
    }
    else {
      reduced Stack = Stack[1];
      result = [V, result];
    }
  }
  return result;
}

var A[10], Path, P;

A[1] = [2, [3, null]];
A[2] = [1, [3, [7, [8, null]]]];
A[3] = [1, [2, [4, [5, null]]]];
A[4] = [3, [5, null]];
A[5] = [3, [4, [6, [8, null]]]];
A[6] = [5, [7, [8, [9, null]]]];
A[7] = [2, [6, [8, [9, null]]]];
A[8] = [2, [5, [6, [7, null]]]];
A[9] = [6, [7, null]];

Path = Cycle(1, A);

println 'Euler path: ';
P = & Path;
while (P != null) {
  println P[0];
  P = & P[1];
}