{"id":225,"date":"2020-11-16T16:35:18","date_gmt":"2020-11-16T15:35:18","guid":{"rendered":"https:\/\/project.inria.fr\/multimod\/?p=225"},"modified":"2020-11-16T17:01:35","modified_gmt":"2020-11-16T16:01:35","slug":"new-source-code-k-shortest-simple-paths","status":"publish","type":"post","link":"https:\/\/project.inria.fr\/multimod\/new-source-code-k-shortest-simple-paths\/","title":{"rendered":"New source code: k Shortest Simple Paths"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-182 alignright\" src=\"https:\/\/project.inria.fr\/multimod\/files\/2020\/11\/graph1.png\" alt=\"\" width=\"260\" height=\"173\"\/><\/a><\/p>\n<p>We are pleased to announce the release (version v1.0) of a collection of algorithms in C++ for solving the k shortest simple paths problem in weighted directed graphs.<\/p>\n<ul>\n<li>Source code: <a href=\"https:\/\/gitlab.inria.fr\/dcoudert\/k-shortest-simple-paths\" rel=\"noopener\" target=\"_blank\">https:\/\/gitlab.inria.fr\/dcoudert\/k-shortest-simple-paths<\/a><\/li>\n<li>Authors: <a href=\"http:\/\/www-sop.inria.fr\/members\/Ali.Al-Zoobi\/\">Ali Al Zoobi<\/a>, <a href=\"http:\/\/www-sop.inria.fr\/members\/David.Coudert\/\">David Coudert<\/a> and <a href=\"http:\/\/www-sop.inria.fr\/members\/Nicolas.Nisse\/\">Nicolas Nisse<\/a> (INRIA Sophia Antipolis M\u00e9diterran\u00e9e, <a href=\"https:\/\/team.inria.fr\/coati\/\">COATI<\/a>)<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>We are pleased to announce the release (version v1\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/multimod\/new-source-code-k-shortest-simple-paths\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":491,"featured_media":227,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10],"tags":[12],"class_list":["post-225","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-software","tag-software"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/posts\/225","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/users\/491"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/comments?post=225"}],"version-history":[{"count":2,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/posts\/225\/revisions"}],"predecessor-version":[{"id":229,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/posts\/225\/revisions\/229"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/media\/227"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/media?parent=225"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/categories?post=225"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/tags?post=225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}