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

An e-mail account, An E-Mail Account: Inbox: Inbox is the main folder ...

An E-Mail Account: Inbox: Inbox is the main folder in your email account. It contains all the e-mails that have arrived in your e-mail account. You can click on inbox to see t

Data base, advantages of file base system

advantages of file base system

Cryptography, Question 1 Consider the one-time pad encryption scheme to en...

Question 1 Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the eve

Storage capacity and cost per bit of storage, Storage capacity and Cost per...

Storage capacity and Cost per bit of storage: Storage capacit y:  It is the amount of data that can be stored in the storage unit. A large capacity is preferred.  Cost pe

Properties of Dictionary Keys, Dictionary values encompass no limitations. ...

Dictionary values encompass no limitations. They can be any random Python object, moreover standard objects or user-defined objects. Though, same is not true for the keys. There ar

Product of first n natural numbers-algorithm, Product of first n natural nu...

Product of first n natural numbers - Algorithm Working Procedure : 1. Take n = 8 2. Take I = 1 3. Take PROD = 1 4. Compute PROD = PROD * 1 5. add 1 to 1 6. If I≤ n, complete

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

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