summaryrefslogtreecommitdiff
path: root/source4/scripting
diff options
context:
space:
mode:
authorDouglas Bagnall <douglas.bagnall@catalyst.net.nz>2015-04-09 13:55:40 +1200
committerAndrew Bartlett <abartlet@samba.org>2015-05-29 11:08:22 +0200
commitcb8b99e335101c5454a1e448275993aa18f77e10 (patch)
tree2d298c935ca40a69e9e19fcc045053987a674866 /source4/scripting
parent75eedf85b1516f0b2370d23d6ff1058a70b093b0 (diff)
downloadsamba-cb8b99e335101c5454a1e448275993aa18f77e10.tar.gz
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 <douglas.bagnall@catalyst.net.nz> Reviewed-by: Garming Sam <garming@catalyst.net.nz> Reviewed-by: Andrew Bartlett <abartlet@samba.org>
Diffstat (limited to 'source4/scripting')
-rwxr-xr-xsource4/scripting/bin/samba_kcc2
1 files changed, 1 insertions, 1 deletions
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],