Python Graph.find_all_paths_from_vertex示例

示例#1

文件： medium_Teads_Sponsored_Challenge.py 项目： Michal-Fularz/codingame_solutions

n = int(input())  # the number of adjacency relations
for i in range(n):
    # xi: the ID of a person which is adjacent to yi
    # yi: the ID of a person which is adjacent to xi
    xi, yi = [int(j) for j in input().split()]

    persons.add_edge((xi, yi))
    persons.add_edge((yi, xi))

#print(persons, file=sys.stderr)

# lets start with first person that has one neighbour
persons_with_1_neighbour = persons.get_vertices_with_n_edges(1)
print("persons_with_1_neighbour: " + str(persons_with_1_neighbour), file=sys.stderr)

paths = persons.find_all_paths_from_vertex(persons_with_1_neighbour[0])
print("paths: " + str(paths), file=sys.stderr)

longest_path_length = max([len(l) for l in paths])
longest_paths = []
for path in paths:
    if len(path) == longest_path_length:
        longest_paths.append(path)
print("longest_paths: " + str(longest_paths), file=sys.stderr)

result = set(longest_paths[0])
for s in longest_paths[1:]:
    result.intersection_update(s)
print("result: " + str(result), file=sys.stderr)

# analyze all the common elements

示例#2

for i in range(n):
    # xi: the ID of a person which is adjacent to yi
    # yi: the ID of a person which is adjacent to xi
    xi, yi = [int(j) for j in input().split()]

    persons.add_edge((xi, yi))
    persons.add_edge((yi, xi))

#print(persons, file=sys.stderr)

# lets start with first person that has one neighbour
persons_with_1_neighbour = persons.get_vertices_with_n_edges(1)
print("persons_with_1_neighbour: " + str(persons_with_1_neighbour),
      file=sys.stderr)

paths = persons.find_all_paths_from_vertex(persons_with_1_neighbour[0])
print("paths: " + str(paths), file=sys.stderr)

longest_path_length = max([len(l) for l in paths])
longest_paths = []
for path in paths:
    if len(path) == longest_path_length:
        longest_paths.append(path)
print("longest_paths: " + str(longest_paths), file=sys.stderr)

result = set(longest_paths[0])
for s in longest_paths[1:]:
    result.intersection_update(s)
print("result: " + str(result), file=sys.stderr)

# analyze all the common elements