Write a function, IsPath, that takes, among other things, an object that represents the adjacency list...

Transcribed Image Text:

Write a function, IsPath, that takes, among other things, an object that represents the adjacency list of the above graph. The function is to return a Boolean value that represents whether or not there exists a directed path between the source and destination nodes. W V Requirements: X N Y Design i. Design an algorithm that accomplishes the above task. 5 points ii. Publish that algorithm HERE, using MS Word or Visio tools 5 points b. Code: Program the above using ANY object-oriented language 5 points c. Run Run the code - PASTE IN THIS ASSIGNMENT - 5 points d. Test different connections between nodes- copy/paste results. - 5 points Note: Per instructions, you MUST WRITE an ALGORITHM before you program. Testing means trying different connections between the vertices. You MUST LABEL the Design, the Code, the Run, and the Test. Write a function, IsPath, that takes, among other things, an object that represents the adjacency list of the above graph. The function is to return a Boolean value that represents whether or not there exists a directed path between the source and destination nodes. W V Requirements: X N Y Design i. Design an algorithm that accomplishes the above task. 5 points ii. Publish that algorithm HERE, using MS Word or Visio tools 5 points b. Code: Program the above using ANY object-oriented language 5 points c. Run Run the code - PASTE IN THIS ASSIGNMENT - 5 points d. Test different connections between nodes- copy/paste results. - 5 points Note: Per instructions, you MUST WRITE an ALGORITHM before you program. Testing means trying different connections between the vertices. You MUST LABEL the Design, the Code, the Run, and the Test.