I need a rust programmer

Depth first search algorithm with a specific data file. Algorithm should count the users current friends, then count our friends friends and then draw the dissimilar sets of connections through depth-first search. Find all the paths between the two vertices. DFS also runs very well on large graphs, its algorithm is fast and accurate. As it is also an edge-based system it performs the computation in two different stages. ultimately finds the traversal of a graph without visiting a node twice, by finding the path of one node to the other nodes.