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

Help with this question, In a certain word game a player can buy vowels and...

In a certain word game a player can buy vowels and consonants. The first vowel is free; each additional vowel cost $1. The first two consonants are free; each additional constant c

Foundation of computer system, Foundation of Computer System Q.No-1: W...

Foundation of Computer System Q.No-1: What do you understand by the Efficiency in term of Computers? and How will you measure it? Also define Speed and its factors which ca

Wat do u do, can u write my assignment for me

can u write my assignment for me

Probability, Mike sells on the average 15 newspapers per week (Monday – Fri...

Mike sells on the average 15 newspapers per week (Monday – Friday). Find the probability that 2.1 In a given week he will sell all the newspapers [7] 2.2 In a given day he will sel

Operation research, origin,nature and impact of operation research

origin,nature and impact of operation research

The elif Statement, The elif statement permits you to check multiple expres...

The elif statement permits you to check multiple expressions for truth value and execute a block of code the moment one of the conditions estimates to true. similar to the else, th

Need a help, i am currently studying my computer science engineering 2nd yr...

i am currently studying my computer science engineering 2nd yr. i am unable to select what specification should i take please help me

Analyze the complexity of dijkstra''s algorithm, QUESTION (a) Given the...

QUESTION (a) Given the graph as shown in figure, apply Lagrangian technique to complete the table assuming μ=1 and T=14                        Path P

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