Fossil SCM
Bug fix in the graph layout algorithm.
Commit
95ae79d5044a4401368e5633893dfb2044c8565f
Parent
2b79f36e5a08740…
1 file changed
+1
-1
+1
-1
| --- src/graph.c | ||
| +++ src/graph.c | ||
| @@ -230,11 +230,11 @@ | ||
| 230 | 230 | |
| 231 | 231 | /* Assign rails to all rows that are still unassigned. |
| 232 | 232 | ** The first primary child of a row goes on the same rail as |
| 233 | 233 | ** that row. |
| 234 | 234 | */ |
| 235 | - inUse = 0; | |
| 235 | + inUse = (1<<(p->mxRail+1))-1; | |
| 236 | 236 | for(pRow=p->pLast; pRow; pRow=pRow->pPrev){ |
| 237 | 237 | int parentRid; |
| 238 | 238 | if( pRow->iRail>=0 ) continue; |
| 239 | 239 | assert( pRow->nParent>0 ); |
| 240 | 240 | parentRid = pRow->aParent[0]; |
| 241 | 241 |
| --- src/graph.c | |
| +++ src/graph.c | |
| @@ -230,11 +230,11 @@ | |
| 230 | |
| 231 | /* Assign rails to all rows that are still unassigned. |
| 232 | ** The first primary child of a row goes on the same rail as |
| 233 | ** that row. |
| 234 | */ |
| 235 | inUse = 0; |
| 236 | for(pRow=p->pLast; pRow; pRow=pRow->pPrev){ |
| 237 | int parentRid; |
| 238 | if( pRow->iRail>=0 ) continue; |
| 239 | assert( pRow->nParent>0 ); |
| 240 | parentRid = pRow->aParent[0]; |
| 241 |
| --- src/graph.c | |
| +++ src/graph.c | |
| @@ -230,11 +230,11 @@ | |
| 230 | |
| 231 | /* Assign rails to all rows that are still unassigned. |
| 232 | ** The first primary child of a row goes on the same rail as |
| 233 | ** that row. |
| 234 | */ |
| 235 | inUse = (1<<(p->mxRail+1))-1; |
| 236 | for(pRow=p->pLast; pRow; pRow=pRow->pPrev){ |
| 237 | int parentRid; |
| 238 | if( pRow->iRail>=0 ) continue; |
| 239 | assert( pRow->nParent>0 ); |
| 240 | parentRid = pRow->aParent[0]; |
| 241 |