{"id":16214339,"url":"https://github.com/lorinczadrien/graphalgorithms","last_synced_at":"2025-04-07T22:18:57.722Z","repository":{"id":214349238,"uuid":"592045119","full_name":"LorinczAdrien/GraphAlgorithms","owner":"LorinczAdrien","description":"A selection of graph algorithms for directed and undirected graphs.","archived":false,"fork":false,"pushed_at":"2023-01-22T19:29:53.000Z","size":34,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-13T23:37:23.516Z","etag":null,"topics":["cplusplus","graphtheory"],"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/LorinczAdrien.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,"governance":null,"roadmap":null,"authors":null}},"created_at":"2023-01-22T18:53:59.000Z","updated_at":"2023-02-13T14:31:29.000Z","dependencies_parsed_at":"2023-12-27T15:55:08.716Z","dependency_job_id":null,"html_url":"https://github.com/LorinczAdrien/GraphAlgorithms","commit_stats":null,"previous_names":["lorinczadrien/graphalgorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LorinczAdrien%2FGraphAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LorinczAdrien%2FGraphAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LorinczAdrien%2FGraphAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LorinczAdrien%2FGraphAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LorinczAdrien","download_url":"https://codeload.github.com/LorinczAdrien/GraphAlgorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247737788,"owners_count":20987735,"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":["cplusplus","graphtheory"],"created_at":"2024-10-10T11:10:23.796Z","updated_at":"2025-04-07T22:18:57.695Z","avatar_url":"https://github.com/LorinczAdrien.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GraphAlgorithms\n A selection of graph algorithms on directed, undirected graphs.\n\n# Important\n- Documentation, functions names are all written in Hungarian.\n\n# Algorithms\n- General graph algorithms (Implemented in parent class 'Graf')\n    - BFS                                       - szelessegi_bejaras\n    - DFS                                       - melysegi_bejaras\n    - Topological sort                          - topologiai_rendezes\n    - Moore's shortest path algorithm           - Moore_SP\n    - Dijkstra's shortest path algorithm        - Dijsktra_SP\n    - Bellman-Ford shortest path algorithm      - Bellman_Ford_SP\n    - Circle detection                          - van_kor\n    - Negative circle detection                 - van_negativ_kor\n    - Is graph regular                          - regularis\n\n- Undirected graph algorithms\n    - Prim's MST algorithm                      - Prim_MST\n    - Kruskal's MST algorithm                   - Kruskal_MST\n    - Boruvka's MST algorithm                   - Boruvka_MST\n    - Reverse-delete MST algorithm              - Forditott_torles_MST\n    - Biconnected components                    - Tarjan_BiConnect\n    - TSP 2 approximation                       - TSP_2_approximate\n    - BFS shortest path between two nodes       - BFS_SP\n\n- Directed graph algorithms\n    - Transitive closure                        - tranzitiv_lezaras or tranzitiv_lezaras_matrix\n    - +- strongly connected components          - plusz_minusz_algoritmus\n    - Kosaraju's strongly connected components  - Kosaraju_algoritmusa\n    - Tarjan's StrongConnect algorithm          - Tarjan_StrongConnect\n    - Johnson's SP between all nodes            - Johnson\n    - Floyd-Warshall SP between all nodes       - Floyd-Warshall\n    - Edmonds-Karp maximum flow                 - Edmonds_Karp\n    - Pump maximum flow algorithm               - Pumpalo_algoritmus\n    - Critical path algorithm                   - Kritikus_ut_masodik_modell\n\n- 'GridGraph' algorithms\n    - BFS shortest path between two nodes       - BFS_SP\n    - A* shortest path between two nodes        - A_stat_SP\n\n- Directed tree algorithms\n    - Center node                               - center_node\n    - Lowest Common Ancestor                    - LCA\n\n- Undirected tree algorithms\n    - Center node                               - center_node\n\n- Binary tree algorithms\n    - Preorder, Inorder, Postorder traversals   - preorder_bejaras, inorder_bejaras, postorder_bejaras\n    - Prufer code algorithm                     - Prufer_kodolas\n\n# Other\n- The '\u003c\u003c' operator is overloaded for every class -\u003e It displays the relevant information stored in class.\n- The '+', '+=' operators are overloaded on: Graf, IranyitatlanGraf, IranyitottGraf -\u003e Add edges, a list of edges or even a whole graph to the current graph.\n- The '-', '-=' operators are overloaded on: Graf, IranyitatlanGraf, IranyitottGraf -\u003e Remove edges, a list of edges or even a whole graph from the current graph.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Florinczadrien%2Fgraphalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Florinczadrien%2Fgraphalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Florinczadrien%2Fgraphalgorithms/lists"}