Older blog entries for sness (starting at number 4998)

python - Breadth-first search trace path - Stack Overflow

python - Breadth-first search trace path - Stack Overflow: "# graph is in adjacent list representation
graph = {
'1': ['2', '3', '4'],
'2': ['5', '6'],
'5': ['9', '10'],
'4': ['7', '8'],
'7': ['11', '12']
}

def bfs(graph, start, end):
# maintain a queue of paths
queue = []
# push the first path into the queue
queue.append([start])
while queue:
# get the first path from the queue
path = queue.pop(0)
# get the last node from the path
node = path[-1]
# path found
if node == end:
return path
# enumerate all adjacent nodes, construct a new path and push it into the queue
for adjacent in graph.get(node, []):
new_path = list(path)
new_path.append(adjacent)
queue.append(new_path)

print bfs(graph, '1', '11')"

'via Blog this'

Syndicated 2013-01-24 23:20:00 from sness

A New Tune Tuesday - Episode 7 - YouTube

A New Tune Tuesday - Episode 7 - YouTube: "