{"id":1523,"date":"2024-11-21T09:34:58","date_gmt":"2024-11-21T01:34:58","guid":{"rendered":"https:\/\/www.fanyamin.com\/wordpress\/?p=1523"},"modified":"2024-11-21T09:34:58","modified_gmt":"2024-11-21T01:34:58","slug":"deep-path-traversal-algorithms","status":"publish","type":"post","link":"https:\/\/www.fanyamin.com\/wordpress\/?p=1523","title":{"rendered":"Deep path traversal algorithms"},"content":{"rendered":"<h2>Overview<\/h2>\n<p>Graph algorithms are a set of instructions that traverse (visits nodes of) a graph and find specific nodes, paths, or a path between two nodes. <\/p>\n<p>Some of these algorithms are built into Memgraph and don't require any additional libraries:<\/p>\n<ul>\n<li>Depth-first search (DFS)<\/li>\n<li>Breadth-first search (BFS)<\/li>\n<li>Weighted shortest path (WSP)<\/li>\n<li>All shortest paths (ASP)<\/li>\n<\/ul>\n<h2>Reference<\/h2>\n<ul>\n<li><a href=\"https:\/\/memgraph.com\/docs\/advanced-algorithms\/deep-path-traversal\">https:\/\/memgraph.com\/docs\/advanced-algorithms\/deep-path-traversal<\/a><\/li>\n<li><a href=\"https:\/\/playground.memgraph.com\/sandbox\/europe-backpacking\">https:\/\/playground.memgraph.com\/sandbox\/europe-backpacking<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Overview Graph algorithms are a set of instructions that traverse (visits nodes of) a graph and find specific nodes, paths, or a path between two nodes. Some of these algorithms are built into Memgraph and don&#8217;t require any additional libraries: Depth-first search (DFS) Breadth-first search (BFS) Weighted shortest path (WSP) All shortest paths (ASP) Reference [&hellip;] <a class=\"read-more\" href=\"https:\/\/www.fanyamin.com\/wordpress\/?p=1523\" title=\"Permanent Link to: Deep path traversal algorithms\">&rarr;Read&nbsp;more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-1523","post","type-post","status-publish","format-standard","hentry","category-5"],"_links":{"self":[{"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/1523"}],"collection":[{"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1523"}],"version-history":[{"count":1,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/1523\/revisions"}],"predecessor-version":[{"id":1524,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/1523\/revisions\/1524"}],"wp:attachment":[{"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1523"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1523"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.fanyamin.com\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1523"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}