I am stuck at this problem. I have to return the path from one corner to another corner in a graph. for eg if there is a graph with a b c d corners and i need the path from a to d then i need to traverse a graph which is something like a binary tree. Help me with the code someone.. the corner is defined by Corner datattype datatype Corner=corner of string*string and datatype graph=list of Corner list..
Thanks help pls
anyone?