Skip to content

A DFS algorithm implementation to find the minimum time to conquer all nodes from root. It takes 1 minute time from one node to its child and the node can conquer its child one at a time. Find the minimum time.

Notifications You must be signed in to change notification settings

rahul-da/Depth-First-Search-Elementary-Implementation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 

Repository files navigation

About

A DFS algorithm implementation to find the minimum time to conquer all nodes from root. It takes 1 minute time from one node to its child and the node can conquer its child one at a time. Find the minimum time.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages