4 Repos
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.
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.
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.
Dieses Projekt ist eine Data-Mining-Algorithmus-Library und eine Referenzimplementierung für Machine Learning. Es bietet eine Sammlung von Tools zur Durchführung von Klassifizierung, Clustering und Assoziationsregel-Mining sowie ein Toolkit für naturinspirierte Optimierung. Die Library enthält spezialisierte Dienstprogramme für Graph- und Sequenz-Mining, die die Extraktion häufiger Teilgraphen und sequenzieller Muster ermöglichen. Zudem verfügt sie über ein Dienstprogramm zur Dimensionsreduktion, das die Rough-Set-Theorie nutzt, um redundante Attribute aus Datensätzen zu entfernen. Das Projekt deckt ein breites Spektrum analytischer Fähigkeiten ab, darunter Netzwerk- und Graphanalyse zur Bewertung der Knotenwichtigkeit sowie die Verwendung probabilistischer Modelle und Entscheidungsbäume zur Datenklassifizierung. Es implementiert zudem distanz- und dichte-basierte Methoden zur Gruppierung von Daten sowie heuristik-basierte Suchmuster zur Lösung komplexer Optimierungsprobleme.
Evaluates the importance of nodes in networks using structural ranking and link analysis.
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.