Lekcja – Graf skierowany
V = [1, 2, 3, 4] E = [(1,2), (1,3),(2,4),(3,4)] # show nodes reachable from node start start = 3 # for x, y in E: # if x == start: # print(y) print([y for (x,y) in E if x == start])
Lab
V = ['Prinzess', 'Dwarfs', 'Queen', 'King', 'Hunter'] E = [ ['Prinzess', 'Dwarfs'], ['Prinzess', 'Queen'], ['Prinzess', 'King'], ['Prinzess', 'Hunder'], ['Queen', 'King'], ['Queen', 'Hunter'], ['King', 'Hunter'] ] # Who knows king? def who_knows_person(person, E): friends = [] for p1, p2 in E: if p1 == person: friends.append(p2) elif p2 == person: friends.append(p1) return friends print(who_knows_person('King', E))