5 repository-uri
Awesome GitHub RepositoriesGraph Cycle Detection
Algorithms for identifying all paths in a graph where the starting and ending nodes match.
Distinct from Hamiltonian Cycle Detection: Distinct from Hamiltonian Cycle Detection: finds any cycle in the graph rather than specifically one that visits every vertex exactly once.
Explore 5 awesome GitHub repositories matching data & databases · Graph Cycle Detection. Refine with filters or upvote what's useful.
Awesome Graph Cycle Detection GitHub Repositories
Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
- kevin-wayne/algs4
kevin-wayne/algs4
7,519Vezi pe GitHubalgs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I
Includes algorithms to determine if a directed graph contains cycles.
Java - sharingsource/logicstack-leetcode
SharingSource/LogicStack-LeetCode
7,495Vezi pe GitHubLogicStack-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 cycle detection in directed graphs using visited and processing state tracking.
algorithminterview-practiceinterview-questions - aalhour/c-sharp-algorithms
aalhour/c-sharp-algorithms
6,159Vezi pe GitHubAcest proiect este o bibliotecă de algoritmi C# și o colecție de structuri de date. Servește ca referință de informatică oferind implementări practice ale tiparelor clasice de sortare, căutare și traversare a grafurilor. Biblioteca include un set de instrumente dedicat procesării șirurilor pentru analizarea similitudinii textului, calcularea distanțelor de editare și gestionarea căutărilor bazate pe prefix. De asemenea, dispune de o implementare a teoriei grafurilor pentru modelarea relațiilor de rețea și calcularea celor mai scurte căi. Codul sursă acoperă o gamă largă de capabilități, inclusiv gestionarea colecțiilor liniare și ierarhice, manipularea și vizualizarea structurilor de date de tip arbore și calcularea secvențelor numerice matematice.
Provides algorithms for detecting cycles and identifying connected components within graph networks.
C# - teivah/algodeck
teivah/algodeck
5,819Vezi pe GitHubAlgodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for
Includes flash cards on detecting cycles in graphs using DFS back edges.
HTML - memgraph/memgraph
memgraph/memgraph
4,163Vezi pe GitHubMemgraph 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 identifies all paths in an undirected graph where the starting and ending nodes match.
C++cyphergraphgraph-algorithms
