遍历搜索图形演示

遍历搜索图形演示 if (currentpoint.row == m_rowcount - 2 && currentpoint.col == m_mulcount - 2) { bret = true; break; } currentpoint.InitSereach(m_maps, irow, icol, m_rowcount - 1, m_mulcount - 1); // up if (currentpoint.up == emSereachResult.dsr_None || currentpoint.up == emSereachResult.dsr_NotSereach) { if (!IsListExists(list, irow - 1, icol)) { tempoint = new CSereachPoint(currentpoint, irow - 1, icol); list.Add(tempoint); currentpoint.nextdirect = emDirect.edt_Up; currentpoint = tempoint; DrawSereachLine(g, emDrawType.edt_Forward, emDirect.edt_Up, irow, icol); irow--; continue; } else { currentpoint.up = emSereachResult.dsr_Done; } } if (currentpoint.up == emSereachResult.dsr_None || currentpoint.up == emSereachResult.dsr_NotSereach) { if (!IsListExists(list, irow - 1, icol)) { tempoint = new CSereachPoint(currentpoint, irow - 1, icol); list.Add(tempoint); currentpoint.nextdirect = emDirect.edt_Up; currentpoint = tempoint; DrawSereachLine(g, emDrawType.edt_Forward, emDirect.edt_Up, irow, icol); irow--; continue; } else { currentpoint.up = emSereachResult.dsr_Done; } }