Skip to main content
Reverse Engineering

Return to Answer

replaced http://zippy.gfycat.com/ with https://zippy.gfycat.com/
Source Link
Community Bot
Community Bot
  • 1

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.Tarjan's Algorithm http://zippy.gfycat.com/ActualSinfulConch.gifTarjan's Algorithm

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.Tarjan's Algorithm http://zippy.gfycat.com/ActualSinfulConch.gif

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.Tarjan's Algorithm

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

Directly include the animation
Source Link
edit approved Jun 17, 2015 at 9:04
Dominik Antal
edit approved Jun 17, 2015 at 9:04
Dominik Antal
  • 2k
  • 22
  • 39

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animationnice animation that helps following the steps.Tarjan's Algorithm http://zippy.gfycat.com/ActualSinfulConch.gif

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.Tarjan's Algorithm http://zippy.gfycat.com/ActualSinfulConch.gif

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.

Source Link
pnX
pnX
  • 416
  • 2
  • 5

I lack 9 reputation points, so sadly I can't comment the great answer by w_s. ;)

Just for completeness, the concept described is known in graph theory as "Tarjan's Algorithm" for finding strongly connected components.

Wikipedia has a nice animation that helps following the steps.

For study, here is another (more formal) Python implementation, it's the one I have used for finding loops in functions in IDAscope but it's easily adapted for finding recursive functions.