2 Repos
Awesome GitHub RepositoriesSimple Path Discovery
Algorithms for finding all paths between nodes that do not visit the same node more than once.
Distinct from Autonomous Path Discovery: Shortlist candidates focus on network routing [f2_mt3] or financial paths [f2_mt4], not general graph theory simple paths.
Explore 2 awesome GitHub repositories matching data & databases · Simple Path Discovery. Refine with filters or upvote what's useful.
Awesome Simple Path Discovery GitHub Repositories
Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
- vesoft-inc/nebula
vesoft-inc/nebula
12,239Auf GitHub ansehenNebula is a distributed graph database designed for storing and querying massive volumes of interconnected vertices and edges across a horizontally scalable cluster. It functions as a Kubernetes-native database and a distributed graph analytics engine, utilizing a Raft-based distributed store to ensure strong consistency and high availability. The system features an OpenCypher query engine for performing complex graph traversals and pattern matching. It distinguishes itself with a decoupled compute-storage architecture and a shared-nothing distributed design, allowing query processing and dat
Calculates the precise sequence of edges and vertices connecting two specific points in the network.
C++big-datacppdatabase - memgraph/memgraph
memgraph/memgraph
4,163Auf GitHub ansehenMemgraph is an in-memory, distributed graph database designed for high-performance labeled property graph management. It utilizes a Cypher query engine for declarative data retrieval and manipulation, providing a scalable knowledge graph backend that integrates vector search and graph traversals. The system distinguishes itself as a real-time graph analytics platform, employing native C++ and CUDA implementations to execute complex network analysis and dynamic community detection on streaming data. It provides specialized support for AI integration, including GraphRAG capabilities, the constr
The product returns every path between two nodes that does not visit the same node twice.
C++cyphergraphgraph-algorithms
