Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
15 views3 pages

Python Code For Uniform Cost Search

The document defines two classes, Node and Edge, to represent a graph structure. It includes methods for adding child nodes and performing uniform cost search (UCS) to find a path from a root node to a goal node. The example demonstrates creating a graph with nodes and edges, and executing UCS to find a path from node 'S' to node 'G'.

Uploaded by

vennira8880
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views3 pages

Python Code For Uniform Cost Search

The document defines two classes, Node and Edge, to represent a graph structure. It includes methods for adding child nodes and performing uniform cost search (UCS) to find a path from a root node to a goal node. The example demonstrates creating a graph with nodes and edges, and executing UCS to find a path from node 'S' to node 'G'.

Uploaded by

vennira8880
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

class Node(object):

"""This class represents a node in a graph."""

def __init__(self, label: str=None):


"""
Initialize a new node.

Args:
label: the string identifier for the node
"""
self.label = label
self.children = []

def __lt__(self,other):
"""
Perform the less than operation (self < other).

Args:
other: the other Node to compare to
"""
return (self.label < other.label)

def __gt__(self,other):
"""
Perform the greater than operation (self > other).

Args:
other: the other Node to compare to
"""
return (self.label > other.label)
def __repr__(self):
"""Return a string form of this node."""
return '{} -> {}'.format(self.label, self.children)

def add_child(self, node, cost=1):


"""
Add a child node to this node.

Args:
node: the node to add to the children
cost: the cost of the edge (default 1)
"""
edge = Edge(self, node, cost)
self.children.append(edge)

class Edge(object):
"""This class represents an edge in a graph."""

def __init__(self, source: Node, destination: Node, cost: int=1):


"""
Initialize a new edge.

Args:
source: the source of the edge
destination: the destination of the edge
cost: the cost of the edge (default 1)
"""
self.source = source
self.destination = destination
self.cost = cost

def __repr__(self):
"""Return a string form of this edge."""
return '{}: {}'.format(self.cost, self.destination.label)
S = Node('S')
A = Node('A')
B = Node('B')
C = Node('C')
D = Node('D')
G = Node('G')
S.add_child(A, 1)
S.add_child(G, 12)
A.add_child(B, 3)
A.add_child(C, 1)

B.add_child(D, 3)

C.add_child(D, 1)
C.add_child(G, 2)

D.add_child(G, 3)
_ = [print(node) for node in [S, A, B, C, D, G]]
from queue import PriorityQueue

def ucs(root, goal):


"""
Return the uniform cost search path from root to gaol.

Args:
root: the starting node for the search
goal: the goal node for the search

Returns: a list with the path from root to goal

Raises: ValueError if goal isn't in the graph


"""
# create a priority queue of paths
queue = PriorityQueue()
queue.put((0, [root]))
# iterate over the items in the queue
while not queue.empty():
# get the highest priority item
pair = queue.get()
current = pair[1][-1]
# if it's the goal, return
if current.label == goal:
return pair[1]
# add all the edges to the priority queue
for edge in current.children:
# create a new path with the node from the edge
new_path = list(pair[1])
new_path.append(edge.destination)
# append the new path to the queue with the edges priority
queue.put((pair[0] + edge.cost, new_path))
ucs(S, 'G')

You might also like