Category "depth-first-search"

Dfs to find visited nodes in sml

What is wrong with this part of code ? I'm trying to make a function which (given a graph) returns a list with all visited nodes, but the compiler keeps saying

given a number k and a graph is there a DFS run that will give forest larger then k

I was given a question that I can't seem to solve. given a directed graph G=(V,E) and a natural number k, k>0. Find an algorithm that will return "YES" if th

I am parsing RoboCopy logs from Millions of files, How can I make my code run Faster?

New to StackOverflow, I'll do my best to post correctly :) Hoping someone can help me to get my code running faster. The code is run against RoboCopy Migration