Solve the no connection puzzle: Difference between revisions
Content added Content deleted
m (→annotated solutions: changed the wording in the output section.) |
m (→annotated solutions: used a more idiomatic way of creating a number of blanks that doesn't require counting.) |
||
Line 1,513: | Line 1,513: | ||
return 0 /*the subroutine arg value passed is OK*/ |
return 0 /*the subroutine arg value passed is OK*/ |
||
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
||
showNodes: _=' |
showNodes: _=left('', 5) /*_ is used for padding the output. */ |
||
show=0 /*indicates no graph has been found yet*/ |
show=0 /*indicates no graph has been found yet*/ |
||
do box=1 for sourceline() while oLimit<0 /*Negative? Then display the diagram. */ |
do box=1 for sourceline() while oLimit<0 /*Negative? Then display the diagram. */ |