# | Line 109 | Line 109 | public class TorusSpanningTree { | |
---|---|---|
109 | int nedges = edges.length; | |
110 | for (int k = 0; k < nedges; ++k) { | |
111 | Node e = edges[k]; | |
112 | < | if (e != null && |
112 | > | if (e != null && |
113 | e.compareAndSetForkJoinTaskTag((short)0, (short)1)) { | |
114 | e.parent = par; | |
115 | e.next = newList; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |