Hi All, I am currently struggling with this function below. Can anyone help me out?
Write the following two functions. ; a graph is ; (make-graph (listof symbol) (symbol -> (listof symbol))) (define-struct<http://docs.plt-scheme.org/htdp-langs/intermediate-lambda-unchanged.html#(form._((lib._lang%2Fhtdp-intermediate-lambda..rkt)._define-struct))> graph (nodes neighbor)) ; has-self-loop? : graph -> boolean ; Determines whether any node in the given graph is its own neighbor ; has-cycle? : graph -> boolean ; Determines whether the given graph has a cycle. A *cycle* is a path from a node to itself, and a *self-loop* is a special case of a cycle that consists of only a single edge.
____________________ Racket Users list: http://lists.racket-lang.org/users
