Hi, I was solving a problem and it required printing euler path on a directed graph Now,I was unaware of the how to do euler path finding on a directed graph, I tried to search on google but no luck..
What exactly are the conditions that are to be fulfilled to KNOW that a euler path exists and also what are ways to print it... I know of "Fleury’s Algorithm" , but as far as I know (and I know little), this algo is for directed graphs only.. Also came to knew about " Hierholzer’s Algorithm" but this also seems to be working on undirected graphs..
The problem that I was attempting -- 508D - Tanya and Password
The editorial of this problem mentions some points regarding finding euler path on directed graphs but it's not very clear and provides no explanation...
Please can some one help me and also possibly provide me with resources where I can study this?!
Have a nice day!