845e17c851184c10ca62122c95d876c35475cc14,osmnx/simplification.py,,_build_path,#Any#Any#Any#Any#,91

Before Change

        // 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
        // close it
        path.append(path[0])

    return path

After Change

                    successor = successors[0]
                    path.append(successor)
                else:
                    if len(successors) == 0:
                        // we are coming to the end of a self-looping edge, so
                        // add path"s first node to end of path to close it,
                        // then return
                        return path + [path[0]]
                    else:
                        // if len successors > 1, then successor must have been
                        // an endpoint because you can go in 2 new directions.
                        // this should never occur in practice
                        raise Exception("Should never hit this point.")

            // if this successor is an endpoint, we"ve completed the path,
            // so return it
            return path


def _get_paths_to_simplify(G, strict=True):

Instances