thanks for th evideo! your github repo is amazing I am shocked!! I wonder how much time it took you to learn such complex algorithms
@CommunistBearFighter5 ай бұрын
Can you please make a video on hierholzer's algorithm specifically on undirected graphs?
@rishabhkumar9406 Жыл бұрын
what changes i would need to do if the graph is directed
@deepakbevinamara4 жыл бұрын
Very nice video with explanation and source code. If the graph has 3 nodes - 0, 1, 2 and the indegree and outdegree of all the nodes are 0. Then, there is an empty Eulerian path, but the code results in "0". Do you think findStartNode() can be enhanced to handle this edge case?
@WilliamFiset-videos4 жыл бұрын
Thanks Deepak, that seems like it's a bug. Filed an issue on Github: github.com/williamfiset/Algorithms/issues/146
@utkarshraj90614 жыл бұрын
first explain the logic then explain the code as it is pretty obvious that many of us are not using java
@rebelScience4 жыл бұрын
He did. You are too lazy to check before writing angry comments. Shame on you.
@utkarshraj90614 жыл бұрын
@@rebelScience if I was lazy , I won't be writing this comment.
@shameekagarwal48724 жыл бұрын
@@utkarshraj9061 did you go through these Euler path/circuit existance: kzbin.info/www/bejne/roOXpHqdrNmFaKs Euler path/circuit algorithm: kzbin.info/www/bejne/bn7ToIJor6ZlopY