From d179e78aeb5befe27c5f1a6be98d994914cb5ffd Mon Sep 17 00:00:00 2001 From: William Silversmith Date: Thu, 13 Jun 2019 02:08:45 -0400 Subject: [PATCH] docs: mentioned region_graph function --- README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/README.md b/README.md index 9940f57..83813a3 100644 --- a/README.md +++ b/README.md @@ -47,6 +47,11 @@ N = np.max(labels_out) for segid in range(1, N+1): extracted_image = labels_out * (labels_out == segid) process(extracted_image) + +# We also include a 26-connected region adjacency graph function +# that returns a set of undirected edges. It is not optimized +# (100x slower than connected_components) but it could be improved. +graph = cc3d.region_graph(labels_out) ``` If you know approximately how many labels you are going to generate, you can save substantial memory by specifying a number a safety factor above that range. The max label ID in your input labels must be less than `max_labels`.