CCG: CEDAR DEFINITIONS = BEGINRef: TYPE = REF Rep;Rep: TYPE;NodeIndex: TYPE = [1..MaxGraphSize];MaxGraphSize: NAT = 200; --%Restriction on the maximum number of nodes in the graph %--MaxEdges: NAT = 20; --%Restriction on the maximum number of edges between nodes%--GraphDirection: TYPE = {pos, neg};InvalidNode: ERROR;FindRootError: ERROR[reason: Reasons1];AssignNodeError: ERROR[reason: Reasons2];Reasons1: TYPE ={NoRoot, MulitpleRoots};Reasons2: TYPE ={NotARoot, CyclicGraph};CleanUpChsProc: TYPE = PROC[chToDestroy, chToMove: REF];EachChAction: TYPE = PROC[ch: REF] RETURNS [quit: BOOL _ FALSE];Create: PROC[] RETURNS[Ref]; CreateNode: PROC[grph: Ref, ch: REF _ NIL] RETURNS[NodeIndex];DestroyNode: PROC[grph: Ref, node: NodeIndex, p: CleanUpChsProc];Size: PROC [grph: Ref] RETURNS [NAT];ConstrainNodes: PROC[grph: Ref, negNd, posNd: NodeIndex, wt: INT];CyclicConstrainp: PROC [grph: Ref, negNd, posNd: NodeIndex] RETURNS [cyclic: BOOL];ResetNode: PROC[grph: Ref, nd: NodeIndex]; -- Clears the nodes so that it can be reused for the next position assignment--ResetAllNodes: PROC[grph: Ref];PosAssignNodePosition: PROC[grph: Ref, root: NodeIndex];NegAssignNodePosition:PROC[grph: Ref, root: NodeIndex];NodePosition: PROC[grph: Ref, nd: NodeIndex, which: GraphDirection] RETURNS[INT];SetNodePosition: PROC[grph: Ref, nd: NodeIndex, which: GraphDirection, position: INT];FindRoot: PROC[grph: Ref, which: GraphDirection] RETURNS[nd: NodeIndex];GetCh: PROC[grph: Ref, nd: NodeIndex] RETURNS [REF];Chs: PROC[grph: Ref, p: EachChAction] RETURNS [BOOL]; --Apply p to ch in all nodes of grph or until p returns True. -- Chs returns true <=> p returns true on none of the ch.END.  è  -- File: CCG.mesa-- Last Edited by: CSChow, February 1, 1985 8:07:16 am PST--Note: CCG = ChannelConstraintGraph--	This is a bidirectional directed graph. Each node in the graph correspond to one channels. --	There are two sets of graphs for a layout, viz, a horizontal graph and a vertical graph. --	Each of which consist of two directed graphs (ie. bottomToTop & topToBottom,--	and leftToRight & rightToLeft.) These graphs are used to compute the --	geometrical information of ChannelTopologyGraph.----ch is associated with the node-- ch is a ref any to make it more general--if there is no edge between negNd and posNd create one with weight wt--  else set weight of existing edge to max. of wt and previous weight-- NB: This implies there is at most one edge between any pair of nodes--TRUE iff add constrain between negNd and posNd will result in a cycle in grph-- = {FOR nd: NodeIndex IN [1..grph.size] DO ResetNode[grph, nd] ENDLOOP};-- Do position assignment in positive direction (left-to-right or bottom-to-top)--Do position assignment in negative direction--Get position of node (after assignment.)-- Used to set the starting position on root node--! ERROR FindRootError-- Get the ch created associated with the node ÊÆ  ˜ Jšœ™Jšœ:™:J˜ J™$J™^J™\J™OJ™HJ™5J™ J™ šÏkœœœ˜J˜ Jšœœœ˜Jšœœ˜
Jšœœ˜$JšœœÏc>˜WJšœ
œž>˜RJ˜ Icode–"Cedar" stylešœœ˜"K–"Cedar" style˜ K–"Cedar" stylešœœ˜K–"Cedar" style˜ K–"Cedar" stylešœœ˜'K–"Cedar" style˜ K–"Cedar" stylešœœ˜)K–"Cedar" style˜ K–"Cedar" stylešœ
œ˜(K–"Cedar" style˜ K–"Cedar" stylešœ
œ˜(K–"Cedar" style˜ K–"Cedar" stylešÏnœœœœ˜8K–"Cedar" style˜ K–"Cedar" stylešŸœœœœœœœ˜@K–"Cedar" style˜ K–"Cedar" stylešŸœœœ˜K–"Cedar" style˜ –"Cedar" styleš
Ÿ
œœœœœ˜>K–"Cedar" style™ K–"Cedar" style™*—K–"Cedar" style˜ K–"Cedar" stylešŸœœ0˜AK–"Cedar" style˜ K–"Cedar" stylešŸœœœœ˜%K–"Cedar" style˜ –"Cedar" stylešŸœœ)œ˜BK–"Cedar" stylešœG™GK–"Cedar" style™FK–"Cedar" style™G—K–"Cedar" style˜ –"Cedar" stylešŸœœ&œ
œ˜SK–"Cedar" style™O—K–"Cedar" style˜ –"Cedar" stylešŸ	œœ˜+K–"Cedar" stylešžO˜O—K–"Cedar" style˜ –"Cedar" stylešŸœœ˜K–"Cedar" styleš	œœœœœ™J—K–"Cedar" style˜ –"Cedar" stylešŸœœ˜8K–"Cedar" style™P—K–"Cedar" style˜ –"Cedar" stylešŸœœ˜7K–"Cedar" style™.—K–"Cedar" style˜ –"Cedar" stylešŸœœ2œœ˜QK–"Cedar" style™*—K–"Cedar" style˜ –"Cedar" stylešŸœœ<œ˜VK–"Cedar" style™1—K–"Cedar" style˜ –"Cedar" stylešŸœœ#œ˜HK–"Cedar" stylešœ™—K–"Cedar" style˜ –"Cedar" stylešŸœœœœ˜4K–"Cedar" style™.—K–"Cedar" style˜ –"Cedar" stylešŸœœœœ˜6K–"Cedar" stylešž>˜>K–"Cedar" stylešœž6˜9—K–"Cedar" style˜ K–"Cedar" stylešœ˜—— …—    Ä  r  