Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
5 lines, recursion solution in Clear category for How to Find Friends by kdim
def check_connection(network, first, second):
def chain(ch):
res = ch | set(sum([c.split('-') for c in network if ch & set(c.split('-'))], []))
return res if ch == res else chain(res)
return second in chain({first})
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", "scout55-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."
Feb. 19, 2021
Comments:
