4 个仓库
Awesome GitHub RepositoriesDistance-Based Node Discovery
Mechanisms for locating nodes within a specific number of hops or a defined distance from a seed node.
Distinct from Isolated Node Discovery: The candidates focus on network cluster discovery or statistical outliers, not graph hop-distance discovery.
Explore 4 awesome GitHub repositories matching data & databases · Distance-Based Node Discovery. Refine with filters or upvote what's useful.
Awesome Distance-Based Node Discovery GitHub Repositories
用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
- sharingsource/logicstack-leetcode
SharingSource/LogicStack-LeetCode
7,495在 GitHub 上查看LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Implements algorithms for finding all nodes exactly K hops away from a target node in a tree.
algorithminterview-practiceinterview-questions - memgraph/memgraph
memgraph/memgraph
4,163在 GitHub 上查看Memgraph 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 locates nodes at a specific distance from a starting point via relationship filters.
C++cyphergraphgraph-algorithms - linyiqun/dataminingalgorithm
linyiqun/DataMiningAlgorithm
3,950在 GitHub 上查看该项目是一个数据挖掘算法库和机器学习参考实现。它提供了一系列用于执行分类、聚类和关联规则挖掘的工具，以及一个用于自然启发式优化的工具包。 该库包括用于图和序列挖掘的专用实用程序，能够提取频繁子图和序列模式。它还具有一个使用粗糙集理论从数据集中删除冗余属性的降维实用程序。 该项目涵盖了广泛的分析功能，包括用于对节点重要性进行排序的网络和图分析，以及用于数据分类的概率模型和决策树。它还实现了用于数据分组的基于距离和密度的方法，以及用于解决复杂优化问题的启发式搜索模式。
Evaluates the importance of nodes in networks using structural ranking and link analysis.
Java - falkordb/falkordb
FalkorDB/FalkorDB
3,437在 GitHub 上查看FalkorDB is a high-performance graph database management system and vector graph database. It serves as a knowledge graph construction tool and a GraphRAG knowledge store, integrating structured property graphs with vector search to provide grounded context for large language models. The engine is designed as a multi-tenant graph engine, capable of hosting thousands of isolated datasets within a single instance. The system distinguishes itself by using linear algebra for query execution, treating relationship tensors as matrix multiplications to achieve low-latency multi-hop traversals. It ut
Measures structural importance of nodes using shortest-path distances for stable entity ranking.
Ccloud-databasedatabasedatabase-as-a-service
