{"id":16575258,"url":"https://github.com/kolosovpetro/graph-algorithms","last_synced_at":"2025-03-27T19:18:08.333Z","repository":{"id":42493903,"uuid":"294986069","full_name":"kolosovpetro/Graph-Algorithms","owner":"kolosovpetro","description":"Learning graph data structure.","archived":false,"fork":false,"pushed_at":"2022-04-03T00:58:13.000Z","size":72,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-14T02:34:54.254Z","etag":null,"topics":["breadth-first-search","depth-first-search","dijkstra-algorithm","graph-algorithms","kahns-alogrithm","topological-sort"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kolosovpetro.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-09-12T16:49:01.000Z","updated_at":"2024-05-27T14:54:47.000Z","dependencies_parsed_at":"2022-09-14T17:52:50.961Z","dependency_job_id":null,"html_url":"https://github.com/kolosovpetro/Graph-Algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kolosovpetro%2FGraph-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kolosovpetro%2FGraph-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kolosovpetro%2FGraph-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kolosovpetro%2FGraph-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kolosovpetro","download_url":"https://codeload.github.com/kolosovpetro/Graph-Algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245907558,"owners_count":20691956,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["breadth-first-search","depth-first-search","dijkstra-algorithm","graph-algorithms","kahns-alogrithm","topological-sort"],"created_at":"2024-10-11T21:47:26.592Z","updated_at":"2025-03-27T19:18:08.301Z","avatar_url":"https://github.com/kolosovpetro.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Algorithms\r\n\r\nContains implementation of most famous algorithms on the graph. Includes algorithms as follows.\r\n\r\n## Implemented Algorithms\r\n\r\n- Dijkstra algorithm\r\n- Floyd–Warshall algorithm (Extension to Dijkstra method for negative-weighted edges in graph)\r\n- Fleury's Algorithm (Finds Eulerian path and circuit in undirected graph)\r\n- Depth-First Search\r\n- Breadth-First Search\r\n- Solving a Maze\r\n- Kahn's algorithm (Topological sort)\r\n- Hierholzer's algorithm (Eulerian path of directed graph)\r\n\r\n## Implemented Data Structues\r\n\r\n- Graph as objects and pointers\r\n- Graph by adjacency matrix\r\n- Graph by adjacency list\r\n\r\n\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkolosovpetro%2Fgraph-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkolosovpetro%2Fgraph-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkolosovpetro%2Fgraph-algorithms/lists"}