Here's the input:
<p><center><table border=3 cellpadding=3><td><pre>
{"XXXX....", 
 "...X.XXX", 
 "XXX..X..", 
 "......X.", 
 "XXXXXXXX"}
coin_row = 2  (these are 1-indexed)
coin_col = 4
</pre></td></table></center><p>

Here's a what a solution looks like with a ladder of size 2:
<p>

<img src=Manao-SS.jpg width=900>
<p>
Your goal is to solve the problem with the minimum size ladder.

<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<h3>Solution 1 - Affix L, build the graph, and DFS to find a path</h3>
Example with <i>L = 3</i>.

<p><center><table border=3><td><img src=Manao1.jpg width=400></td></table></center><p>

<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<h3>Solution 2 - Sort the edges and add them incrementally with disjoint sets</h3>
Example with <i>L = 3</i>.

<p><center><table border=3><td><img src=Manao2.jpg width=400></td></table></center><p>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<p><center><table border=3><td><img src=Manao3.jpg width=400></td></table></center><p>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<hr>
<p><center><table border=3><td><img src=Manao4.jpg width=400></td></table></center><p>