# hierholzer (2)

Algorithm to find the number of distinct paths in a directed graph

Possible Duplicate: Graph Algorithm To Find All Connections Between Two Arbitrary Vertices I have a directed graph, what algorithm can i use to find the number of distinct acyclic paths between 2 p…

python - Finding a Eulerian Tour

I am trying to solve a problem on Udacity described as follows:#Find Eulerian Tour## Write a function that takes in a graph#represented as a list of tuples#and return a list of nodes that#y…