Graph Algorithms

Archived PuppyGraph 0.x documentation

This is the archived 0.x documentation. For new deployments, use puppygraph/puppygraph:latest (PuppyGraph 1.x) and the current docs. The 0.x schemas and UI described here don't apply to 1.x; see Migrating from v0.

Graph algorithms are computational methods used to solve specific problems on graph.

PuppyGraph provides a wide range of graph algorithms to help you solve your graph problems.

• Centrality
  • PageRank
• Clustering
  • Label Propagation Algorithm
  • Louvain Method
  • Weakly Connected Components
• Graph Embedding
  • Node2Vec
• Path Finding
  • Iterative Simple Path Finding
  • Longest Path in a Directed Acyclic Graph
• Shortest Paths
  • Breadth First Search
  • Bellman-Ford Algorithm
  • Delta-Stepping Algorithm
  • Dijkstra's Algorithm
  • Johnson's Algorithm
  • Yen's K-Shortest Paths Algorithm
• Graph Reachability
  • Connected Component Finding

Stay tuned as we add detailed documentation for algorithms and expand our graph algorithm library.

If you have any requests, please let us know by contacting us.