mirror of
https://github.com/samba-team/samba.git
synced 2024-12-22 13:34:15 +03:00
cb8b99e335
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> |
||
---|---|---|
.. | ||
examples | ||
samba | ||
samba_external | ||
modules.c | ||
modules.h | ||
pyglue.c | ||
uuidmodule.c | ||
wscript_build |