mirror of
https://github.com/samba-team/samba.git
synced 2025-01-27 14:04:05 +03:00
kcc: correctly calculate the number of components
Signed-off-by: Garming Sam <garming@catalyst.net.nz> Signed-off-by: Douglas Bagnall <douglas.bagnall@catalyst.net.nz> Reviewed-by: Andrew Bartlett <abartlet@samba.org>
This commit is contained in:
parent
9864192a26
commit
bb4c35011b
@ -2808,7 +2808,7 @@ def kruskal(graph, edges):
|
||||
for v in graph.vertices:
|
||||
v.edges = []
|
||||
|
||||
components = set(graph.vertices)
|
||||
components = set([x for x in graph.vertices if not x.is_white()])
|
||||
edges = list(edges)
|
||||
|
||||
# Sorted based on internal comparison function of internal edge
|
||||
|
Loading…
x
Reference in New Issue
Block a user