
DIRECTORY
QPSolve, Rope;

QPSetup: CEDAR DEFINITIONS
= BEGIN
OPEN QPSolve;

ROPE: TYPE ~ Rope.ROPE;

noRow: INT ~ -1;

Graph: TYPE ~ REF GraphRep;
GraphRep: TYPE ~ RECORD [order: INT, nV: NAT, vList: VertexList, eqnList: EqnList];
Vertex: TYPE ~ REF VertexRep;
VertexRep: TYPE ~ RECORD [name: ROPE, visited: INT, tree: Edge, adj: EdgeList, val: REAL _ 0.0, vid: INT];
VertexList: TYPE ~ REF VertexListRep;
VertexListRep: TYPE ~ RECORD [name: ROPE, first: Vertex, rest: VertexList, forward: Skips];
Level: TYPE ~ NAT;
Skips: TYPE ~ REF SkipsRep;
SkipsRep: TYPE ~ RECORD[SEQUENCE level: Level OF VertexList];
Edge: TYPE ~ REF EdgeRep;
EdgeRep: TYPE ~ RECORD [thisEnd, thatEnd: Vertex, eData: EdgeData, dir: REAL _ 1.0];
EdgeList: TYPE ~ LIST OF Edge;
EdgeData: TYPE ~ REF EdgeDataRep;
EdgeDataRep: TYPE ~ RECORD [
join: Component,
spread: REAL _ 0.0,
squeeze: REAL _ 1.0,	-- actually, SqRt[squeeze]
relaxed: REAL _ 0.0,
var: NAT,
val: REAL _ 0.0];
Term: TYPE ~ RECORD [eData: EdgeData, coef: REAL];
TermList: TYPE ~ LIST OF Term;
EqnList: TYPE ~ LIST OF TermList;
Component: TYPE ~ REF ComponentRep;
ComponentRep: TYPE ~ RECORD [
join: Component,
weight: INT,
edges: EdgeList,
cycleEqns, extraEqns: EqnList];
ComponentList: TYPE ~ LIST OF Component;

FindComponents: PROC [g: Graph] RETURNS [compList: ComponentList _ NIL];

CoupleComponents: PROC [compList: ComponentList, extraEqns: EqnList]
RETURNS [coupledList: ComponentList];

FindFreeVars: PROC [cycleEqns, extraEqns: EqnList, nEqns, nVars: NAT]
RETURNS [rowOf: IVector];

SolveComponent: PROC [component: Component];

SolveGraph: PROC [g: Graph];

NewGraph: PROC RETURNS [g: Graph];
AcquireVertex: PROC [g: Graph, name: ROPE] RETURNS [v: Vertex];
AcquireEdge: PROC [g: Graph, thisEnd, thatEnd: Vertex] RETURNS [edge: Edge];
SpreadEdge: PROC [g: Graph, edge: Edge, spread: REAL];
SqueezeEdge: PROC [g: Graph, edge: Edge, squeeze: REAL];
RelaxEdge: PROC [g: Graph, edge: Edge, relaxed: REAL];
ConstrainEdges: PROC [g: Graph, termList: TermList];

ListGraph: PROC [g: Graph, full: BOOL _ FALSE] RETURNS [list: LIST OF REF];
ESee: PROC [edge: Edge, full: BOOL _ FALSE] RETURNS [list: LIST OF REF];
ELSee: PROC [edges: EdgeList, full: BOOL _ FALSE] RETURNS [list: LIST OF REF];
ListComp: PROC [comp: Component, full: BOOL _ FALSE] RETURNS [list: LIST OF REF];
END..


    
QPSetup.mesa
Copyright ╙ 1990 by Xerox Corporation.  All rights reserved.
Ken Shoemake, June 15, 1990 1:58 am PDT
Return list of biconnected components of graph, with necessary cycle equations.
From list of graph bi-connected components (with cycle equations), and list of constraint equations, create list of coupled components.  A coupled component will contain the edges and equations of all components whose edges co-occur as variables in some constraint equation, and will also contain the relevant constraint equations.
Return rowOf filled with index of row for free vars, noRow for rest of vars.
Index means little now; just needs to be different from noRow.
Transform component data into QP form and call QPSolve.
Transform graph into QP form, call QPSolve, propagate positions.
Э╩  ХNewlineDelimiter
Щ ЩJЩ<JЩ'ЧJШ Ъ╧k	Ш	JЪЬШJШ ЧJЪ╤bnxЬЭЬЭШJЪЬЭШJЪЭЬ	ШJШ JЪЭЬЭЬЭЬШJШ JЪЬЭЬШJШ JЪЬЭЬЭЬ
ШJЪ	Ь
ЭЬЭЬ	ЭЬЭЬ'ШSJЪЬЭЬЭЬШJЪЬЭЬЭЬЭЬЭЬ"ЭЬЭЬШjJЪЬЭЬЭЬШ%JЪЬЭЬЭЬЭЬ3Ш[JЪЬЭЬЭЬШJЪЬЭЬЭЬ
ШJЪ	Ь
ЭЬЭЬЭЬЭЬШ=JЪЬЭЬЭЬ	ШJЪЬ	ЭЬЭЬ2ЭЬШTJЪЬ
ЭЬЭЬЭЬШJЪЬ
ЭЬЭЬШ!ЪЬЭЬЭЬШJЪЬШJЪЬЭЬШJЪЬ	ЭЬ╧cШ/JЪЬ	ЭЬШJЪЬЭЬШ	JЪЬЭЬШЧJЪЬЭЬЭЬЭЬШ2JЪЬ
ЭЬЭЬЭЬШJЪЬ	ЭЬЭЬЭЬ
Ш!JЪЬЭЬЭЬШ#ЪЬЭЬЭЬШJЪЬШJЪЬЭЬШJЪЬШJЪЬШЧJЪЬЭЬЭЬЭЬШ(JШ Ъ╧nЬЭЬЭЬЭЬШHJЩOJШ ЧЪаЬЭЬ/ЭЬШjJЩ╦JШ ЧЪаЬЭЬ/ЭЬЭЬШ_JЪЬLЩLJЩ>JШ ЧЪаЬЭЬШ,JЩ7JШ ЧЪа
ЬЭЬШJЩ@JШ ЧJЪаЬЭЬЭЬШ"JЪ	аЬЭЬЭЬЭЬЭШ?JЪаЬЭЬ&ЭЬЭШLJЪа
ЬЭЬ ЭЬЭШ6JЪаЬЭЬ!ЭЬЭШ8JЪа	ЬЭЬ!ЭЬЭШ6JЪаЬЭЬЭШ4JШ JЪа	ЬЭЬЭЬЭЬЭЬЭЬЭЬЭЬЭШKJЪаЬЭЬЭЬЭЬЭЬЭЬЭЬЭЬШHJЪаЬЭЬЭЬЭЬЭЬЭЬЭЬЭЬШNJЪаЬЭЬЭЬЭЬЭЬЭЬЭЬЭЬШQJЪЭЬШJШ JШ Ч ЕЧ    	  :  