Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for How to Find Friends by dasich12
def check_connection(network, first, second):
Visited = {first}
netW = []
newcurr = [first]
for i in network:
netW.append(set(i.split("-")))
while newcurr:
curr = list(newcurr)
newcurr.clear()
for j in curr:
for k in netW:
if (j in k):
if second in k:
return True
tmp = k.difference({j})
if not (tmp.issubset(Visited)):
Visited = Visited.union(tmp)
newcurr.append("".join(tmp))
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."
Sept. 14, 2015
