Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Simple DFS solution in Clear category for How to Find Friends by nptwz
from collections import defaultdict
def check_connection(network, first, second):
net = defaultdict(list)
visited = {}
for edge in network:
u,v = edge.split('-')
net[u].append(v)
net[v].append(u)
def dfs(v):
if v in visited:
return
visited[v]=1
for next in net[v]:
dfs(next)
dfs(first)
return second in visited
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"scout2", "scout3") == True, "Scout Brotherhood"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"super", "scout2") == True, "Super Scout"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"dr101", "sscout") == False, "I don't know any scouts."
Aug. 27, 2014
