help a tiny Scheme problem

liunx

Guest
This is first time I played with Scheme, I got a question to design a scheme code to find a given undirected graph is connected. like ((a <img src="http://static.dreamincode.net/forums/style_emoticons/default/cool.gif" style="vertical-align:middle" emoid="B)" border="0" alt="cool.gif" /> (c d) (b d) (a c)) is connected but ((a <img src="http://static.dreamincode.net/forums/style_emoticons/default/cool.gif" style="vertical-align:middle" emoid="B)" border="0" alt="cool.gif" /> (c d) (b d) (a e)) is not connected. I try to thinking the soluion like what I did in C++, but failed . so I have no idea how to do this.
</div>
 
Top