{"id":897,"date":"2009-08-05T16:13:00","date_gmt":"2009-08-05T15:13:00","guid":{"rendered":"http:\/\/it4bus.vn\/itersdesktop\/2009\/08\/05\/research-algorithms-to-optimize-the-placements\/"},"modified":"2009-08-05T16:13:00","modified_gmt":"2009-08-05T15:13:00","slug":"research-algorithms-to-optimize-the-placements","status":"publish","type":"post","link":"https:\/\/www.itersdesktop.com\/fr\/2009\/08\/05\/research-algorithms-to-optimize-the-placements\/","title":{"rendered":"Research algorithms to optimize the placements"},"content":{"rendered":"<p>1. Find the longest cycle in the graph<\/p>\n<ul>\n<li><a href=\"http:\/\/www.personal.kent.edu\/~rmuhamma\/Algorithms\/MyAlgorithms\/GraphAlgor\/depthSearch.htm\"><span><span>Depth First Search (DFS) (applying to find the cycle)<\/span><\/span><\/a><\/li>\n<li>\n<a href=\"http:\/\/coding.derkeiler.com\/Archive\/General\/comp.theory\/2004-02\/0462.html\"><span>Finding cycles in a directed graph<\/span><\/a> (newsgroup and mailing list archives in the net)<span><\/span>\n<\/li>\n<li><a href=\"http:\/\/coding.derkeiler.com\/Archive\/Java\/comp.lang.java.help\/2006-01\/msg00003.html\">How to detect circle in a directed graph<\/a><\/li>\n<li><a href=\"http:\/\/stackoverflow.com\/questions\/546655\/finding-all-cycles-in-graph\">Finding all cycles in graph<\/a><\/li>\n<li><a href=\"http:\/\/stackoverflow.com\/questions\/261573\/best-algorithm-for-detecting-cycles-in-a-directed-graph\">Best algorithm for detecting cycles in a directed graph<\/a><\/li>\n<li><a href=\"http:\/\/neopythonic.blogspot.com\/2009\/01\/detecting-cycles-in-directed-graph.html\">Detecting cycles in directed graph<\/a><\/li>\n<li><a href=\"http:\/\/groups.google.com\/group\/networkx-discuss\/browse_thread\/thread\/f591e7b85e091935?fwc=1&#038;pli=1\"><span>Good way to find ALL cycles within a graph<\/span><\/a><\/li>\n<li><a href=\"http:\/\/en.wikipedia.org\/wiki\/Strongly_connected_components\"><span>Strongly connected components<\/span><\/a><\/li>\n<li><span><a href=\"http:\/\/en.wikipedia.org\/wiki\/Tarjan%27s_strongly_connected_components_algorithm\">Tarjan&rsquo;s strongly connected components algorithm<\/a><\/span><\/li>\n<li><span><a href=\"http:\/\/en.wikipedia.org\/wiki\/Cycle_detection\">Cycle detection<\/a><\/span><\/li>\n<li><span><a href=\"http:\/\/www.ics.uci.edu\/~eppstein\/161\/960220.html\">Strongly connected components (Lecture notes)<\/a><br \/><\/span><\/li>\n<\/ul>\n<p>2. Find all pairs shortest path Algorithm<\/p>\n<p>* Sample Code: http:\/\/www.codeguru.com\/cpp\/cpp\/algorithms\/article.php\/c5119<br \/>* Shortest Path Algorithms: http:\/\/www.umich.edu\/~me558\/manuals\/LEDA\/shortest_path.html<\/p>\n<p>3. Detect a cycle in the graph<\/p>\n<p>* Extending the shortest-path swarm algorithm to cycle detection: http:\/\/ieeexplore.ieee.org\/Xplore\/login.jsp?url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F10622%2F33557%2F01594255.pdf%3Farnumber%3D1594255&#038;authDecision=-203<\/p>\n","protected":false},"excerpt":{"rendered":"<p>1. Find the longest cycle in the graph Depth First Search (DFS) (applying to find the cycle) Finding cycles in a directed graph (newsgroup and mailing list archives in the&hellip; <\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-897","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/897","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/comments?post=897"}],"version-history":[{"count":0,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/897\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/media?parent=897"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/categories?post=897"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/tags?post=897"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}