Skip to content
#

graph-traversal

Here are 162 public repositories matching this topic...

gograph

Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.

  • Updated Oct 31, 2026
  • Go

Open-source graph query service layer for ClickHouse and Databricks, written in Rust, turning an existing database into a graph view in minutes. It also provides an embedded mode with chdb, now supporting writes.

  • Updated Oct 31, 2026
  • Python
neurodivergent-memory

A TypeScript-based MCP server implementing a memory system inspired by neurodivergent cognitive styles. It organizes thoughts into five districts (knowledge domains), ranks search results using BM25 semantic ranking, and stores memories as a persistent knowledge graph with bidirectional connections.

  • Updated Oct 30, 2026
  • JavaScript

A fine-tuned visual implementation of Informed and Uninformed Search Algorithms such as Breadth First Search, Depth First Search, Uniform Cost Search, A* Search, Greedy First Search

  • Updated Mar 7, 2020
  • Python

Add this topic to your repo

To associate your repository with the graph-traversal topic, visit your repo's landing page and select "manage topics."

Learn more