depth-first-search

问题 I'm trying to adapt a Depth-First Search algorithm in Python to solve the Knight's Tour puzzle. I think I've nearly succeeded, by producing a dictionary of predecessors for all the visited squares. However, I'm stuck on how to find the autual path for the Knight. Currently, using the current return value from tour() in path() gives a disappointing path of [(0, 0), (2, 1)] . I think the crux of the issue is determining at what point inside tour() all squares are visited and at that point

问题 I have a webpage which has multiple links and sub-links in flow as below To click on the child elements (2,7,8 and so on...) I'm using driver.find_elements_by_xpath (all of the sub-links can be found by combination of class & div) and looping if i have more than one link (technically a nested for loop for each child) . Can this be optimized into a function, like a recursive Depth first search? Below is the code snippet which i tried. def iterate_child_links(): elements = driver.find_elements

问题 I am trying to find (using Python) all possible solutions to a maze. I have a DFS script that returns one solution. I am trying to adapt it but I'm really having a hard time wrapping my head around the whole recursion thing. Here's the code I have, which works for finding one possible solution using DFS: Any tips or help would be much appreciated! (The "lett" in the array can be ignored/considered regular "path") def DFS(x,y,Map): if (Map[x][y]=="exit"): #check if we're at the exit return [(x

问题 I looked at Tim Hall's excellent article here, that allows you to work with self-referenced entities and show hierarchical data (starting with top level nodes and joining back recursively), using CTE like syntax in Oracle. So I have code that looks like this: WITH J1(JOBMST_ID, JOBMST_NAME, JOBMST_PRNTID, JOBMST_TYPE, LVL) AS ( SELECT JOBMST_ID, JOBMST_NAME, JOBMST_PRNTID, JOBMST_TYPE, 1 FROM TIDAL.JOBMST WHERE JOBMST_PRNTID IS NULL UNION ALL SELECT J2.JOBMST_ID,J2.JOBMST_NAME,J2.JOBMST

问题 I looked at Tim Hall's excellent article here, that allows you to work with self-referenced entities and show hierarchical data (starting with top level nodes and joining back recursively), using CTE like syntax in Oracle. So I have code that looks like this: WITH J1(JOBMST_ID, JOBMST_NAME, JOBMST_PRNTID, JOBMST_TYPE, LVL) AS ( SELECT JOBMST_ID, JOBMST_NAME, JOBMST_PRNTID, JOBMST_TYPE, 1 FROM TIDAL.JOBMST WHERE JOBMST_PRNTID IS NULL UNION ALL SELECT J2.JOBMST_ID,J2.JOBMST_NAME,J2.JOBMST

问题 I understand there are 3 common ways to represent graphs: Adjacency Matrix Adjacency List Edge list That said, problems I’ve solved on LeetCode often use matrices and the solution requires DFS or BFS. For example, given the matrix below, find if a target string exists when you go left, right, up, and down (but not diagonal). [ [‘a’,‘p’,’p’], [‘e’,’a’,’l’], [‘r’,’t’,’e’] ] This required a DFS approach. Is this because this matrix represents a graph or does DFS and BFS apply to matrices too and

问题 Given a binary matrix of size N x M. The task is to find the distance of nearest 1 in the matrix for each cell. The distance is calculated as |i1 – i2| + |j1 – j2|, where i1, j1 are the row number and column number of the current cell and i2, j2 are the row number and column number of the nearest cell having value 1. Input: The first line of input is an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of 2 lines . The first line of each test case

问题 I know this is usually done with breadth first, but we are asked to do it with both, I already accomplished breadth first.... I feel like this is a pretty typical example of using a depth first search, so I was hoping I could get some help here... I am attempting to find the shortest path through a maze using depth first search, but as of right now I cannot wrap my head around how exactly to do it. This is my code so far: void maze::findPathRecursive(graph &g, int position, int goal) { if

问题 I've seen other questions about depth first search but my problem is slightly different and I really don't get it. In prolog, I represent my undirected graph like this: [0-[1,5], 1-[0,2], 2-[1,3], 3-[2,0], 5-[0]] Which is a set of key-value, where the key represents the node and the list: -[] represents its neighbors. I don't know how to do a depth first search with this model. I've tried many solution. I want a really basic recursive algorithm like this one: dfs(v, visited): if visited[v]

问题 I've seen other questions about depth first search but my problem is slightly different and I really don't get it. In prolog, I represent my undirected graph like this: [0-[1,5], 1-[0,2], 2-[1,3], 3-[2,0], 5-[0]] Which is a set of key-value, where the key represents the node and the list: -[] represents its neighbors. I don't know how to do a depth first search with this model. I've tried many solution. I want a really basic recursive algorithm like this one: dfs(v, visited): if visited[v]