diff options
author | Douglas Bagnall <douglas.bagnall@catalyst.net.nz> | 2015-05-08 12:19:51 +1200 |
---|---|---|
committer | Andrew Bartlett <abartlet@samba.org> | 2015-06-12 06:57:16 +0200 |
commit | 84fb4afe874d235936ab4a3c7b70f69c095e6b94 (patch) | |
tree | 948344be2de4edcb3a1b2f96fd52fea48b59ebc6 /python | |
parent | 61c1d8ad390c70507618bde1a6c659e92a62e286 (diff) | |
download | samba-84fb4afe874d235936ab4a3c7b70f69c095e6b94.tar.gz |
KCC: docstring for kcc.graph.add_int_edge()
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 'python')
-rw-r--r-- | python/samba/kcc/graph.py | 18 |
1 files changed, 16 insertions, 2 deletions
diff --git a/python/samba/kcc/graph.py b/python/samba/kcc/graph.py index fe2185ad65c..f951c52dcb4 100644 --- a/python/samba/kcc/graph.py +++ b/python/samba/kcc/graph.py @@ -511,9 +511,23 @@ def process_edge(graph, examine, internal_edges): add_int_edge(graph, internal_edges, examine, bestv, v) -# Add internal edge, endpoints are roots of the vertices to pass in -# and are always red or black def add_int_edge(graph, internal_edges, examine, v1, v2): + """Add edges between compatible red and black vertices + + Internal edges form the core of the tree -- white and RODC + vertices attach to it as leaf nodes. An edge needs to have black + or red endpoints with compatible replication schedules to be + accepted as an internal edge. + + Here we examine an edge and add it to the set of internal edges if + it looks good. + + :param graph: the graph object. + :param internal_edges: a set of internal edges + :param examine: an edge to examine for suitability. + :param v1: a Vertex + :param v2: the other Vertex + """ root1 = v1.root root2 = v2.root |