Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
BFS solution in Clear category for How to Find Friends by shtorin5
def check_connection(network, first, second):
path = [first]
visited = []
while path:
current_name = path.pop()
visited.append(current_name)
for connection in network:
pair = connection.split('-')
if current_name in pair:
pair.remove(current_name)
if pair[0] not in visited:
path.append(pair[0])
if second in path:
return True
return False
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."
April 5, 2015
