algorithm - Find start and end position of "cover-all" path then connect them -



algorithm - Find start and end position of "cover-all" path then connect them -

i have shape in 2darray (for example):

it known points , b (i not know where) , path covers entire shape (must walk through each cell) must exist. can give me help on how determine points , b , "cover-all" path? maybe there known algorithms such case. or help pseudo-code algorithm. in advance.

check nhahdth's link see problem in general np-hard. this mathoverflow article cites paper establishing result graphs on grids holes - won't fare improve using brute forcefulness unless can come more constraints.

you may lucky in identifying @ to the lowest degree 1 of start , end nodes searching vertices of grade 1 in underlying grid cell graph.

algorithm path-finding

Comments

Popular posts from this blog

web services - java.lang.NoClassDefFoundError: Could not initialize class net.sf.cglib.proxy.Enhancer -

Accessing MATLAB's unicode strings from C -

javascript - mongodb won't find my schema method in nested container -