Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here’s your problem today. This problem was recently asked by Apple:

Given a list of undirected edges which represents a graph, find out the number of connected components.

def num_connected_components(edges): # Fill this in.

print(num_connected_components([(1, 2), (2, 3), (4, 1), (5, 6)]))


In the above example, vertices 1, 2, 3, 4 are all connected, and 5, 6 are connected, and thus there are 2 connected components in the graph above.