Scheme, computer science, Basic Computer Science

Assignment Help:
There is a path between two vertices if there is a series of edges that you can use to travel between them. For example, between vertices 1 and 3 above, there is a path made up of the edges (1 2) and (2 3), written ((1 2)(2 3)). A path may not include repeated vertices.
Write two functions: in Scheme, a predicate path?, which takes a graph and two numbers indicating vertices, which returns true iff there is a path between them.:

(path? ''(5 ((1 2)(2 3)(3 4)(3 5)(4 5))) 1 5)
#t
(path? ''(5 ((1 2)(3 4)(3 5)(4 5))) 1 5)
#f

In Prolog, write a query path(+G, +V1, +V2) which succeeds iff there is a path in graph G between vertices V1 and V2.

path(graph(5, [[1,2],[2,3],[3,4],[3,5],[4,5]]), 1 5).
true.
path(graph(5, [[1,2],[3,4],[3,5],[4,5]]), 1 5).
false.

Related Discussions:- Scheme, computer science

Power point microsoft, what are slides how do you put slides on powerpoint

what are slides how do you put slides on powerpoint

Explain Processes Vs Threads?, In many respect threads operate in the simil...

In many respect threads operate in the similar way as that of processes. A number of the similarity and differences are: Similarities • Similar to processes threads share CPU and o

Assignment, Assignment of computer science

Assignment of computer science

Compare between file processing system and dbms, Problem a. Compare bet...

Problem a. Compare between file processing system and DBMS >>This is a comparison of DBMS with file processing system which the answer has to be searched from the GOOGLE an

Third generation of computers, THE THIRD GENERATION (1966-1975) ...

THE THIRD GENERATION (1966-1975) The introduction of IBM-360 series of computers in 1965 marked the beginning of this generation. The transistors were replaced by solid

Explain digital multiplexers, Problem 1 Perform the following conversio...

Problem 1 Perform the following conversion a. (ABE) 16 =() 2 b. (101011) 2 =() 10 2 Explain how full adder adds three bits 3 Explain digital multiplexers

TREES, construct a tree where preorder is ABCDFGE

construct a tree where preorder is ABCDFGE

Explain Process States and Process Control Block (PCB), Process States Thr...

Process States Throughout the lifespan of a process, its execution position may be in one of four states: (linked with each state is generally a queue on which the process resides)

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd