Data.lastBranchPoint) {
            return false;
        }

        var qp = q.prev;
        if (qp) {
            var distance = q.which - neighbor.dest.which;
            for (var i = 0; i < qp.neighbors.length; i++) {
                var odistance = qp.which - qp.neighbors[i].dest.which;
                if (distance == odistance) {
                    return true;
                }
            }
        }
        return false;
    }

    function filterOutSequentialBranches(type) {
        var quanta = 