From cb8b99e335101c5454a1e448275993aa18f77e10 Mon Sep 17 00:00:00 2001 From: Douglas Bagnall Date: Thu, 9 Apr 2015 13:55:40 +1200 Subject: KCC: improve directed_double_ring graph check The previous test assumed there would be only a double directed ring but in fact there could be other edges. In large graphs there are certain to be more edges. Now we want to be sure there is a complete ring apart from any other connections. This is called the Hamiltonian path problem and takes exponential time in general, so now our test is that it looks *quite* a lot like a complete ring. Signed-off-by: Douglas Bagnall Reviewed-by: Garming Sam Reviewed-by: Andrew Bartlett --- source4/scripting/bin/samba_kcc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'source4/scripting') diff --git a/source4/scripting/bin/samba_kcc b/source4/scripting/bin/samba_kcc index 13d29e5d9c1..94ac01a7714 100755 --- a/source4/scripting/bin/samba_kcc +++ b/source4/scripting/bin/samba_kcc @@ -2173,7 +2173,7 @@ class KCC(object): dot_edges.append((v2, v1.dsa_dnstr)) dot_vertices.add(v2) - verify_properties = ('connected', 'directed_double_ring') + verify_properties = ('connected', 'directed_double_ring_or_small') verify_and_dot('intrasite_pre_ntdscon', dot_edges, dot_vertices, label='%s__%s__%s' % (site_local.site_dnstr, nctype_lut[nc_x.nc_type], -- cgit v1.2.1