[Help-glpk] Cycles in graphs

[nicolas66]

Hi all,

I'd like to detect if a directed graph contains a least one cycle but I
don't see how to write the associated constraint in a linear program. I have
looked at the examples given in glpk but I haven't found something near to
what I'm looking for. So, any idea is welcome. Thanks in advance for your
help :)


--
Nicolas.
-- 
View this message in context: 
http://old.nabble.com/Cycles-in-graphs-tp28039694p28039694.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.