From 84cfe9f19e28c349a0f215af6e2ab7b2ba63a17c Mon Sep 17 00:00:00 2001
From: Philipp Schlegel <observing@web.de>
Date: Tue, 23 Feb 2021 12:55:51 +0000
Subject: [PATCH] first pass at merge_duplicate_nodes function

---
 navis/graph/clinic.py | 143 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 143 insertions(+)

diff --git a/navis/graph/clinic.py b/navis/graph/clinic.py
index c2d9ec4b..6473c223 100644
--- a/navis/graph/clinic.py
+++ b/navis/graph/clinic.py
@@ -11,9 +11,15 @@
 #    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 #    GNU General Public License for more details.
 
+import networkx as nx
+import numpy as np
+
 from .. import core
 
 
+__all__ = ['health_check', 'merge_duplicate_nodes']
+
+
 def health_check(x: 'core.NeuronObject', verbose: bool = True) -> None:
     """Run a health check on TreeNeurons and flag potential issues.
 
@@ -30,6 +36,7 @@ def health_check(x: 'core.NeuronObject', verbose: bool = True) -> None:
 
     Examples
     --------
+    >>> import navis
     >>> n = navis.example_neurons(1)
     >>> navis.health_check(n)
     Neuron 1734350788 seems perfectly fine.
@@ -64,3 +71,139 @@ def health_check(x: 'core.NeuronObject', verbose: bool = True) -> None:
             print(f'Neuron {str(x.id)} seems perfectly fine.')
 
     return issues if issues else None
+
+
+def merge_duplicate_nodes(x, round=False, inplace=False):
+    """Merge nodes the occupy the exact same position in space.
+
+    Note that this might produce connections where there previously weren't
+    any!
+
+    Parameters
+    ----------
+    x :         TreeNeuron | NeuronList
+                Neuron to fix.
+    round :     int, optional
+                If provided will round node locations to given decimals. This
+                can be useful if the positions are floats and not `exactly` the
+                the same.
+    inplace :   bool
+                If True, perform operation on neuron inplace.
+
+    Returns
+    -------
+    TreeNeuron
+                Fixed neuron. Only if ``inplace=False``.
+
+    """
+    if isinstance(x, core.NeuronList):
+        if not inplace:
+            x = x.copy()
+
+        for n in x:
+            _ = merge_duplicate_nodes(n, round=round, inplace=True)
+
+        if not inplace:
+            return x
+        return
+
+    if not isinstance(x, core.TreeNeuron):
+        raise TypeError(f'Expected TreeNeuron, got "{type(x)}"')
+
+    if not inplace:
+        x = x.copy()
+
+    # Figure out which nodes are duplicated
+    if round:
+        dupl = x.nodes[['x', 'y', 'z']].round(round).duplicated(keep=False)
+    else:
+        dupl = x.nodes[['x', 'y', 'z']].duplicated(keep=False)
+
+    if dupl.sum():
+        # Operate on the edge list
+        edges = x.nodes[['node_id', 'parent_id']].values.copy()
+
+        # Go over each non-unique location
+        ids = x.nodes.loc[dupl].groupby(['x', 'y', 'z']).node_id.apply(list)
+        for i in ids:
+            # Keep the first node and collapse all others into it
+            edges[np.isin(edges[:, 0], i[1:]), 0] = i[0]
+            edges[np.isin(edges[:, 1], i[1:]), 1] = i[0]
+
+        # Drop self-loops
+        edges = edges[edges[:, 0] != edges[:, 1]]
+
+        # Make sure we don't have a->b and b<-a edges
+        edges = np.unique(np.sort(edges, axis=1), axis=0)
+
+        G = nx.Graph()
+
+        # Get nodes but drop ""-1"
+        nodes = edges.flatten()
+        nodes = nodes[nodes >= 0]
+
+        # Add nodes
+        G.add_nodes_from(nodes)
+
+        # Drop edges that point away from root (e.g. (1, -1))
+        # Don't do this before because we would loose isolated nodes otherwise
+        edges = edges[edges.min(axis=1) >= 0]
+
+        # Add edges
+        G.add_edges_from([(e[0], e[1]) for e in edges])
+
+        # First remove cycles
+        while True:
+            try:
+                # Find cycle
+                cycle = nx.find_cycle(G)
+            except nx.exception.NetworkXNoCycle:
+                break
+            except BaseException:
+                raise
+
+            # Sort by degree
+            cycle = sorted(cycle, key=lambda x: G.degree[x[0]])
+
+            # Remove the edge with the lowest degree
+            G.remove_edge(cycle[0][0], cycle[0][1])
+
+        # Now make sure this is a DAG, i.e. that all edges point in the same direction
+        new_edges = []
+        for c in nx.connected_components(G.to_undirected()):
+            sg = nx.subgraph(G, c)
+
+            # Try picking a node that was root in the original neuron
+            is_present = np.isin(x.root, sg.nodes)
+            if any(is_present):
+                r = x.root[is_present][0]
+            else:
+                r = list(sg.nodes)[0]
+
+            # Generate parent->child dictionary by graph traversal
+            this_lop = nx.predecessor(sg, r)
+
+            # Note that we assign -1 as root's parent
+            new_edges += [(k, v[0]) for k, v in this_lop.items() if v]
+
+        # We need a directed Graph for this as otherwise the child -> parent
+        # order in the edges might get lost
+        G2 = nx.DiGraph()
+        G2.add_nodes_from(G.nodes)
+        G2.add_edges_from(new_edges)
+
+        # Generate list of parents
+        new_edges = np.array(G2.edges)
+        new_parents = dict(zip(new_edges[:, 0], new_edges[:, 1]))
+
+        # Drop nodes that aren't present anymore
+        x._nodes = x._nodes.loc[x._nodes.node_id.isin(new_edges.flatten())].copy()
+
+        # Rewire kept nodes
+        x.nodes['parent_id'] = x.nodes.node_id.map(lambda x: new_parents.get(x, -1))
+
+        # Reset temporary attributes
+        x._clear_temp_attr()
+
+    if not inplace:
+        return x