mentor/derived/ShortestPathAlgClass.i3

 Copyright (C) 1995, Digital Equipment Corporation.       
 All rights reserved.                                     
 See the file COPYRIGHT for a full description.           
                                                          
 Last modified on Thu Feb  9 08:47:37 PST 1995 by kalsow  
 Last modified on Wed Feb 17 16:44:58 PST 1993 by johnh   
      modified on Tue Jun  9 00:35:07 1992 by mhb         


********************************************************************

      *  NOTE: This file is generated automatically from the event
      *        definition file ShortestPath.evt.
      ********************************************************************



INTERFACE ShortestPathAlgClass;

<*NOWARN*> IMPORT TextConv, Algorithm, AlgorithmClass;

<* PRAGMA LL *>

TYPE
  EventDataRec = RECORD
    stopAtNewVertex: BOOLEAN := TRUE;
    waitAtNewVertex: CARDINAL := 1;
    ctOfNewVertex: CARDINAL := 0;
    stopAtNewEdge: BOOLEAN := TRUE;
    waitAtNewEdge: CARDINAL := 1;
    ctOfNewEdge: CARDINAL := 0;
    stopAtStartFind: BOOLEAN := TRUE;
    waitAtStartFind: CARDINAL := 1;
    ctOfStartFind: CARDINAL := 0;
    stopAtPromote: BOOLEAN := TRUE;
    waitAtPromote: CARDINAL := 1;
    ctOfPromote: CARDINAL := 0;
    stopAtConsider: BOOLEAN := TRUE;
    waitAtConsider: CARDINAL := 1;
    ctOfConsider: CARDINAL := 0;
    stopAtTraceback: BOOLEAN := TRUE;
    waitAtTraceback: CARDINAL := 1;
    ctOfTraceback: CARDINAL := 0;
  END;

  T <: Public;
  Public = Algorithm.T OBJECT
      eventDataRec: EventDataRec;

      METHODS
      END;

REVEAL
  Algorithm.T <: AlgorithmClass.T;

END ShortestPathAlgClass.