Skip to content

Latest commit

 

History

History
32 lines (17 loc) · 728 Bytes

File metadata and controls

32 lines (17 loc) · 728 Bytes

FLEURY ALGORITHM


What is it

  • It's a very useful algorithm to find the over the many disconnected bridges over the hierholzer algo.
  • This algorithm is the alternative of Hierholzer's Algorithm of directed graph.
  • This algorithm is used to find the euclerian circuit but this algorithm can also find the path in the disconnected graph also.

TechStack

PYTHON


Modules Used:

  • collections

Screenshot

Screenshot


Author

Avdhesh Varshney