"-no-hash" naming
Fix trimDGraph to handle cycles. Drop longest-path calculation. About to re-add.
Split trimDGraph and longestPath. Both work for cyclic graphs!
Disentangled longestPath from uuGraph and circuitGraph.
Tolerate missing In and Out
portComp returns Maybe
mendG & friends
rips and patches for implementing loopC. See notes from 2014-11-07.
constraint=false for Cons in-edges
Replaced CompS with CompNum in SourceInfo (as previously)
comment about longestPath and mending
MealyP
asFun
asFun: comment and INLINE
mealyAsArrow; unconstrainDelays
DelayP
LoopCat, DelayCat
more on constraint=false
INLINE pragmas
loop, delay