Deep path traversal algorithms

by walter

Table of Contents

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't require any additional libraries:

  • Depth-first search (DFS)
  • Breadth-first search (BFS)
  • Weighted shortest path (WSP)
  • All shortest paths (ASP)

Reference

Comments |0|

Legend *) Required fields are marked
**) You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>
Category: 似水流年