[英]How to find connected components in an array
我正在hackerrank, Roads and Libraries中嘗試算法問題。 問題的根源是使用DFS使用數組查找連接的組件(CC)。
這是測試用例:
queries = [
{
n_cities_roads: [9,2],
c_lib_road: [91, 84],
matrix: [
[8, 2], [2, 9]
]
},
{
n_cities_roads: [5,9],
c_lib_road: [92, 23],
matrix: [
[2,1], [5, 3], [5,1],
[3,4], [3,1], [5, 4],
[4,1], [5,2], [4,2]
]
},
{
n_cities_roads: [8,3],
c_lib_road: [10, 55],
matrix: [
[6,4], [3,2], [7,1]
]
},
{
n_cities_roads: [1, 0],
c_lib_road: [5, 3],
matrix: []
},
{
n_cities_roads: [2, 0],
c_lib_road: [102, 1],
matrix: []
}
]
queries.each do |query|
(n_city, n_road), (c_lib, c_road) = [*query[:n_cities_roads]], [*query[:c_lib_road]]
roads_and_libraries n_city, c_lib, c_road, query[:matrix]
end
輸出應為:
805
184
80
5
204
我目前的以下解決方案在某些情況下可以獲得CC,但並非所有情況都可以。
def dfs(i, visited, matrix)
visited[i] = true
unless matrix[i].nil?
matrix[i].each do |j|
unless visited[j]
dfs j, visited, matrix
end
end
end
end
def roads_and_libraries(no_cities, c_lib, c_road, cities)
return c_lib * no_cities if c_lib <= c_road
visited, count = Array.new(no_cities, false), 0
(0..no_cities).each do |i|
unless visited[i]
count += 1
dfs i, visited, cities
end
end
p (c_road * (no_cities - count)) + (c_lib * count)
end
上面我的代碼的測試輸出為:
805
184
7
305
我正在努力了解如何正確使用DFS查找連接的組件。 不知道我要去哪里錯了。
只需打印以下行:
p roads_and_libraries n_city, c_lib, c_road, query[:matrix]
不是這個
p (c_road * (no_cities - count)) + (c_lib * count)
因為方法中有返回值:
return c_lib * no_cities if c_lib <= c_road
我不知道算法,但似乎矩陣不能為空[]
,至少必須為[[1,1]]
才能獲得所需的輸出:
roads_and_libraries 1, 5, 3, [[1,1]] #=> 5
roads_and_libraries 2, 102, 1, [[1,1]] #=> 204
因此,要處理空矩陣,一種方法是將其添加為dfs
方法的第一行:
matrix = [[1,1]] if matrix.empty?
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.