{"items": [{"author": "Danner", "source_link": "https://www.facebook.com/jefftk/posts/610228664742?comment_id=610228719632", "anchor": "fb-610228719632", "service": "fb", "text": "I'm pretty sure cycle checks are a standard graph programming problem. I'd either refuse the input or stop once a cycle is detected.", "timestamp": "1366285883"}, {"author": "Jeff&nbsp;Kaufman", "source_link": "https://www.facebook.com/jefftk/posts/610228664742?comment_id=610228794482", "anchor": "fb-610228794482", "service": "fb", "text": "@Danner: \"refuse the input or stop once a cycle is detected\"<br><br>Your program wouldn't let me add my three uncles, Quentin, Robert, and Sven, to our family not-really-tree?", "timestamp": "1366286017"}, {"author": "Danner", "source_link": "https://www.facebook.com/jefftk/posts/610228664742?comment_id=610228829412", "anchor": "fb-610228829412", "service": "fb", "text": "You can add the uncles, but you can't attach all three in a directed relation to each other.", "timestamp": "1366286075"}, {"author": "Danner", "source_link": "https://www.facebook.com/jefftk/posts/610228664742?comment_id=610228884302", "anchor": "fb-610228884302", "service": "fb", "text": "...or I could just make an structure that is capable of cyclic paths, have you actually checked any of these programs?", "timestamp": "1366286183"}]}