User Account

All Pages

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

., why first generation computers are better than fourth generation compute...

why first generation computers are better than fourth generation computers

Explain with diagram the internal components of alu, Problem 1. Explain...

Problem 1. Explain with diagram the internal components of ALU. Diagram Explaining Internal components 2. What is addressing mode? Explain any five addressing mo

Creating Navigational Buttons in Oracle, Need some help in creating custom ...

Need some help in creating custom forms navigational buttons in oracle 10g

Database design, design railway maintenance system. draw er diagram.

design railway maintenance system. draw er diagram.

Explain acl with its types, Question 1 Discuss the two basic operational c...

Question 1 Discuss the two basic operational characteristics of RR Only an active route is redistributed Route redistribution does not impact local route selection

Explain the common properties of nurbs surfaces, Question 1 What are the a...

Question 1 What are the advantages of Computer Interactive Graphics? Question 2 Which are the different types of camera views available in Maya? Question 3 Explain

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

Computer programming, outline and explain in detail any 10 application area...

outline and explain in detail any 10 application areas of vb.net

Integers, what is the size of a void integer and what is it''s range

what is the size of a void integer and what is it''s range

Data base, advantages of file base system

advantages of file base system

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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