Changes between Initial Version and Version 1 of Ticket #5452, comment 32


Ignore:
Timestamp:
2019-06-25T13:07:58Z (5 years ago)
Author:
Karim Adbdelhak

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #5452, comment 32

    initial v1  
    88I build a bipartite graph from the described loop as presented in the paper about reshuffling by @vwaurich and attached it as an image and a graphml version. It seems like the algorithm should be able to handle it, but i have to dig deeper into the algorithm to fully comprehend it. There is one line in the paper i stumpled upon:
    99''The case of having both eqCrossNodes and varCrossNodes in one cycle is practically very uncommon. If it does occur, these cycles are not resolved.''
    10 For short reference, crossNodes are nodes with more than two edges. Although it does not look like it applies here, there may be some correlation we did not take into account.
     10For short reference, crossNodes are nodes with more than two edges. Although it does not look like it applies here (nodes with only one edges are removed beforehand), there may be some correlation we did not take into account.
    1111> We should investigate why {{{resolveLoops}}} does not figure this out, and extend that algorithm to also handle this case. Then, we should also consider whether to make {{{resolveLoops}}} active by default, as it may be essential in handling some models which are found out there.
    1212It seems like this should be activated on default, but i guess it isn't for performance reasons?