https://github.com/lorinczadrien/graphalgorithms

A selection of graph algorithms for directed and undirected graphs.
https://github.com/lorinczadrien/graphalgorithms

cplusplus graphtheory

Last synced: about 1 year ago
JSON representation

A selection of graph algorithms for directed and undirected graphs.

• Host: GitHub
• URL: https://github.com/lorinczadrien/graphalgorithms
• Owner: LorinczAdrien
• Created: 2023-01-22T18:53:59.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2023-01-22T19:29:53.000Z (over 3 years ago)
• Last Synced: 2025-02-13T23:37:23.516Z (over 1 year ago)
• Topics: cplusplus, graphtheory
• Language: C++
• Homepage:
• Size: 33.2 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# GraphAlgorithms

 A selection of graph algorithms on directed, undirected graphs.

# Important

- Documentation, functions names are all written in Hungarian.

# Algorithms

- General graph algorithms (Implemented in parent class 'Graf')

    - BFS                                       - szelessegi_bejaras

    - DFS                                       - melysegi_bejaras

    - Topological sort                          - topologiai_rendezes

    - Moore's shortest path algorithm           - Moore_SP

    - Dijkstra's shortest path algorithm        - Dijsktra_SP

    - Bellman-Ford shortest path algorithm      - Bellman_Ford_SP

    - Circle detection                          - van_kor

    - Negative circle detection                 - van_negativ_kor

    - Is graph regular                          - regularis

- Undirected graph algorithms

    - Prim's MST algorithm                      - Prim_MST

    - Kruskal's MST algorithm                   - Kruskal_MST

    - Boruvka's MST algorithm                   - Boruvka_MST

    - Reverse-delete MST algorithm              - Forditott_torles_MST

    - Biconnected components                    - Tarjan_BiConnect

    - TSP 2 approximation                       - TSP_2_approximate

    - BFS shortest path between two nodes       - BFS_SP

- Directed graph algorithms

    - Transitive closure                        - tranzitiv_lezaras or tranzitiv_lezaras_matrix

    - +- strongly connected components          - plusz_minusz_algoritmus

    - Kosaraju's strongly connected components  - Kosaraju_algoritmusa

    - Tarjan's StrongConnect algorithm          - Tarjan_StrongConnect

    - Johnson's SP between all nodes            - Johnson

    - Floyd-Warshall SP between all nodes       - Floyd-Warshall

    - Edmonds-Karp maximum flow                 - Edmonds_Karp

    - Pump maximum flow algorithm               - Pumpalo_algoritmus

    - Critical path algorithm                   - Kritikus_ut_masodik_modell

- 'GridGraph' algorithms

    - BFS shortest path between two nodes       - BFS_SP

    - A* shortest path between two nodes        - A_stat_SP

- Directed tree algorithms

    - Center node                               - center_node

    - Lowest Common Ancestor                    - LCA

- Undirected tree algorithms

    - Center node                               - center_node

- Binary tree algorithms

    - Preorder, Inorder, Postorder traversals   - preorder_bejaras, inorder_bejaras, postorder_bejaras

    - Prufer code algorithm                     - Prufer_kodolas

# Other

- The '<<' operator is overloaded for every class -> It displays the relevant information stored in class.

- The '+', '+=' operators are overloaded on: Graf, IranyitatlanGraf, IranyitottGraf -> Add edges, a list of edges or even a whole graph to the current graph.

- The '-', '-=' operators are overloaded on: Graf, IranyitatlanGraf, IranyitottGraf -> Remove edges, a list of edges or even a whole graph from the current graph.