lab 3

docx

School

Arizona State University *

*We aren’t endorsed by this school

Course

360

Subject

Computer Science

Date

Dec 6, 2023

Type

docx

Pages

Uploaded by ProfStraw17234

Jordan Whitecar IFT 360 lab 3 The resulting path is different! Kept original breadth_first call for comparison. def depth_first_traversal (self, start_node_name, target_node_name): #check if start node is part of the graph if start_node_name not in self.graph.nodes: print(start_node_name, "not found in graph!") return #check if start node is the target node if start_node_name == target_node_name: print("Start node is the target node! No search needed.") return #setup data structures to keep track of reached nodes and #nodes that ae yet to be expanded per breadth-first reached_nodes = {} reached_nodes[start_node_name] = 1

nodes_to_expand = [start_node_name] #construct the traversal tree, starting at the root. self.tree = Tree() rootNode = TreeNode(start_node_name, None) self.tree.set_root(rootNode) while len(nodes_to_expand) > 0: #expand the node at the beginning of the espansion list node_name = nodes_to_expand.pop() children = self.graph.expand_node(node_name) for child in children: #for each new child child_name = child[0] child_edgewt = child[1] #if child is target, return solution! if child_name == target_node_name: n = TreeNode(child_name,node_name) self.tree.add_child_node( n , node_name, child_edgewt) print('Target Reached!') self.tree.print_path(n) return #if child is a newly reached node, add to expansion list, tree if child_name not in reached_nodes: reached_nodes[child_name] = 1 nodes_to_expand.append(child_name) n = TreeNode(child_name,node_name) self.tree.add_child_node( n, node_name, child_edgewt)

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

Related Documents

MCCG240 - Coding Scenario – Mock Exam Training Week 4 Laura Engel.docx

Siddique, In Class Assignment 1 Revised.docx

DAD 220 Database Documentation 6-1 Project 1 Golda Smith.docx

Assignment # 4 Analyzing Classroom Data to Plan Intervention.docx

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Principles of Information Systems (MindTap Course...

Computer Science

ISBN:9781285867168

Author:Ralph Stair, George Reynolds

Publisher:Cengage Learning

Fundamentals of Information Systems

Computer Science

ISBN:9781305082168

Author:Ralph Stair, George Reynolds

Publisher:Cengage Learning

Oracle 12c: SQL

Computer Science

ISBN:9781305251038

Author:Joan Casteel

Publisher:Cengage Learning

SEE MORE TEXTBOOKS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning