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

Artificial intelligence-intelligence performanc of computer , "Just how are...

"Just how are we capable to get a computer to performe intelligent tasks?" One thing to answer the question is to tell that: Logic generate a science out of many forms of re

Noemalization.., what is means with respect to software engineering?

what is means with respect to software engineering?

Second generation of computers, THE SECOND GENERATION (1956-1965) ...

THE SECOND GENERATION (1956-1965) This generation of computers were characterized by:     Considerable reduction in physical size     Increased reliability

Explain the different types of addressing modes, Question 1 What are the d...

Question 1 What are the different stages of evolution of Computer Architecture? Explain in detail Question 2 What are the components of Instruction Set architecture? Discu

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

Explain the concept of a transition graph, Question 1 Define the concept o...

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

Why assembly language is good?, Because it is enormously low level, assembl...

Because it is enormously low level, assembly language can be optimized enormously well. Therefore assembly language is used where the extreme performance is needed for applications

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

3 phyla names , what is the three phyla nam

what is the three phyla name

Theory of computation, If L is a regular language show that L U {a} is regu...

If L is a regular language show that L U {a} is regular

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