I want to represent a graph in Dr. Scheme in the following manner: For each node I want to store it\'s value and a list of adjacent nodes,the problem which i\'m having difficulties with is that I wan
This is a homework question,I\'m trying to do a Depth-first search function in Scheme,Here\'s the code I\'ve written so far:
writea scheme function that remo开发者_运维知识库ve the first top level occurrence of a given item
I\'m facing a problem with the car and cdr functions for example: first I defined a list called it x (define x (a (bc) d ( (ef) g ) ))
I\'m using drscheme from: http://www.archlinux.org/packages/extra/x86_64/drscheme/ I\'m trying to work with the sample code in my textbook, but I keep开发者_如何学Go getting getting \"unbound identif
Closed. This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this
I have a Scheme macro and a long list, and I\'d like to map the macro across the list, just as if it were a function. How can I do that using R5RS?
I have to determine if an undirected graph contains a cycle or not. I shoudn\'t use set! instructions.
I\'m stuck on the extended exercise 28.2 of How to Design Programs.I used a vector of true or false values to represent the board instead of using a list.This is what I\'ve got which doesn\'t work:
I tried to implement a \"pairing heap\" with all the regular operations (merge, delete-min etc.), then I\'ve been requested to write a function that would sort a list using my newly constructed heap i
加载中,请稍侯......