n="justify">. left = left;
this . vesselAreas = vesselAreas;
this . flux = flux;
this . t = t; = new Matrix (2 * atm. size () + 1, atm. size ());
}
public Matrix resolveMatrix ()
{
if (left)
{
double flux0 = flux [0];
double fluxFin = flux [0]; singlePressureFirstCondition = resolveSinglePressureEndCondition (0, a, b, c, flux0, fluxFin, t); . setMatrix (0, 2 * atm. size (), index, index, singlePressureFirstCondition); + +;
}. traverseTree ( this );
return result;
}
public void visit (Vessel v)
{[v. index] = v. area;
if (atm. isEvenNode (v) == left)
return ;
if (v. left! = null && v. right! = null )
{singlePressureConditionLeft = resolveSinglePressureCondition (v, v. left. index, a, b, c);. setMatrix (0, 2 * atm. size (), index, index, singlePressureConditionLeft); + +; singlePressureConditionRight = resolveSinglePressureCondition (v, v. right. index, a, b, c);. setMatrix (0, 2 * atm. size (), index, index, singlePressureConditionRight); + +; singleFluxCondition = resolveSingleFluxCondition (v. index, v. left. index, v. right. index, a, b, c);. setMatrix (0, 2 * atm. size (), index, index, singleFluxCondition); + +;
}
else
{
double flux0 = flux [0];
double fluxFin = flux [v. index]; singlePressureEndCondition = resolveSinglePressureEndCondition (v. index, a, b, c, flux0, fluxFin, t);. setMatrix (0, 2 * atm. size (), index, index, singlePressureEndCondition); + +;
}
}
private Matrix resolveSinglePressureCondition...