Crossings Minimization
1.0

implementation of utilities for computing and updating the "stretch" of edges, where stretch is of edge vw is defined to be abs( p(v)/(L(v)1)  p(w)/(L(w)1) ) Here p(x), L(x) are the position and layer of x, respectively; if there is only one node on a layer, the denominator is replaced by 2. More...
Go to the source code of this file.
Functions  
double  stretch (Edgeptr e) 
implementation of utilities for computing and updating the "stretch" of edges, where stretch is of edge vw is defined to be abs( p(v)/(L(v)1)  p(w)/(L(w)1) ) Here p(x), L(x) are the position and layer of x, respectively; if there is only one node on a layer, the denominator is replaced by 2.
Definition in file stretch.c.
double stretch  (  Edgeptr  e  ) 
Definition at line 15 of file stretch.c.
References edge_struct::down_node, node_struct::layer, layers, node_struct::name, layer_struct::number_of_nodes, node_struct::position, stretch(), and edge_struct::up_node.
Referenced by maxEdgeStretchInChannel(), maxStretchEdge(), stretch(), and totalChannelStretch().