电路遍历

来源：互联网发布：沈广隆剑铺淘宝网编辑：程序博客网时间：2024/05/22 07:08
function MainScene:rejudge()    local inpts = {}    local judgetime = 0    local return_table = {}    local newt = {}    for k,v in pairs(self.keys) do        if v[1] == 0 or v[2] == 0 then            local _input = (v[1] == 0) and v[2] or v[1]            table.insert(inpts, _input)        end    end    --dump(inpts)    local function travel(tb, prev, trace, visit)        if #tb == 0 or tb[1] == 1111 then            if #tb ~= 0 then                table.insert(trace, tb[1])            else                --断路情况            end            for k,v in pairs(trace) do                print(v)            end            trace = {}            newt = {}            print("over")            return        end               local old_trace        local old_visit                local tprev        newt = {}        table.insert(trace, tb[1])        visit[tostring(tb[1])] = 1        for _k,_v in pairs(tb) do            for k,v in pairs(self.keys) do                if v[1] ~= prev and v[2] ~= prev then                    if v[1] == _v or v[2] == _v then                        tprev = ((v[1] == _v) and v[1] or v[2])                        local ist = ((v[1] == _v) and v[2] or v[1])                        if visit == nil then                            print(ist.." has problem and duan lu le")                            return                        end                        if visit[tostring(ist)] == nil then                            old_trace = clone(trace)                            old_visit = clone(visit)                            visit[tostring(ist)] = 1                            table.insert(newt, ist)                            travel(newt, tprev, trace, visit)                            trace = old_trace                            visit = old_visit                            newt = {}                        end                                             end                end            end        end    end    --visit["0"] = 1    travel(inpts, 0, {}, {})end
0 0