wikigenius/dfs

DFS algorithm A standard DFS implementation puts each vertex of the graph into one of two categories: Visited Not Visited The purpose of the algorithm is to mark each vertex as visited while avoiding cycles. The DFS algorithm works as follows: Start by putting any one of the graph's vertices on top of a stack. Take the top item of the stack and add it to the visited list. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the top of stack. Keep repeating steps 2 and 3 until the stack is empty.

Hi there 👋

I'm Muhammed Elyamani. AI Engineer with master's degree from Ottawa. I'm from Egypt with a passion for software development and integrating AI models into powerful applications.

• 🔭 I'm currently working on SignLingua.

I am always eager to learn new technologies and develop my skills.

If you're interested in learning more about my work, take a look at my repositories or feel free to reach out to me with any questions or comments. I'd love to hear from you!

Thank you for visiting my GitHub profile.

📈 my github stats

Best regards,

M. Eng Muhammed Elyamani