## Tagged: graph theory Toggle Comment Threads | Keyboard Shortcuts

• #### frankiezafe 23:39 on 2016-12-16 Permalink | Reply Tags: algorithm ( 13 ), graph theory, Peel ( 21 ), processing.org ( 4 ), research ( 10 )

Looking for loops in networks.

It’s seems very simple, but when i’ve started to search for a programmatic way to solve this, you ends up with a kind of complexity that seems much too high compared to the problem.

After a bit of research, i found the Rocha Thatte method. It is a very elegant way to detect “cycles” in “directed graphs”. Description in wikipedia.

This is a js implementation, based on the java version, used to study the implementation.

• #### frankiezafe 21:29 on 2016-11-16 Permalink | Reply Tags: algorithm ( 13 ), graph theory, Peel ( 21 ), research ( 10 )

Finding cycles in networks.

Since several days, i was trying to solve a problem that will occur in : how to broke a connection when the connection is part of a “cycle” (i’ve called it “loop” until now). This problem is illustrated here:

The beginning of the answer is in wikipedia and uses graph theory >> https://en.wikipedia.org/wiki/Cycle_(graph_theory)

Can’t wait to start coding that 🙂

c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r