🔒 Need help to work this algorithm out

[simple harbor]

The description of the labyrinth made of matrix is attached.

And my question is, How can we get the number of sets of cul-de-sacs?

I've try DFS, but I don't know how to mark a path if it is a cul-de-sac

Here's the description of cul-de-sac:
the number of accessible cul-de-sacs (a cul-de-sac is a maximal set S of connected inner points that can all be accessed from the same gate g and such that for all points p in S, if p has been accessed from g for the first time, then either p is in a dead end or moving on without ever getting back
leads into a dead end)

[rigid blaze]

@simple harbor

Python help channel opened

Remember to:

• Ask your Python question, not if you can ask or if there's an expert who can help.
• Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
• Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.

[simple harbor]

:lock Need help to work this algorithm out

Need help to work this algorithm out

:lock: Need help to work this algorithm out

[fair sinew]

what have you tried with DFS?

also don't put a lock in the title that's just kinda confusing

[simple harbor]

Need help to work this algorithm out

[simple harbor]

I have modified the title, and I tried to find all the paths begin with a unique gate with DFS and mark all the points in these paths, and then judge every path to see if it will leads to a cul-de-sacs. But seems like it doesn't work😣

[fair sinew]

what do you mean by a unique gate?

[simple harbor]

yes, in this way, I can get all the paths in a labyrinth

[fair sinew]

what's a unique gate?

[rigid blaze]

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.