ff30bea0877f1ef4b177e48a2a2b6f34b7aaa298,osmnx/simplification.py,,_build_path,#Any#Any#Any#Any#,91

Before Change

            // if this successor is already in the path, ignore it, otherwise add
            // it to the path
            path.append(successor)
            if successor not in endpoints:
                // if this successor is not an endpoint, recursively call
                // build_path until you find an endpoint
                path = _build_path(G, successor, endpoints, path)
            else:
                // if this successor is an endpoint, we"ve completed the path,
                // so return it
                return path

    if (path[-1] not in endpoints) and (path[0] in G.successors(path[-1])):
        // if the end of the path is not actually an endpoint and the path"s
        // first node is a successor of the path"s final node, then this is
        // actually a self loop, so add path"s first node to end of path to

After Change

            // it to the path
            path.append(successor)
            while successor not in endpoints:
                nodes = [n for n in G.successors(successor) if n not in path]
                // If nodes is empty, we should be on a self contained ring
                // If nodes is longer than one, we fork into two paths
                if len(nodes) == 1:

Instances