Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity
master-algorithms-py/graphs
History
marina 907bf738ec
Create bfs.py
2023-08-06 17:08:35 -07:00
..
bfs.py
Create bfs.py
2023-08-06 17:08:35 -07:00
dfs.py
Create dfs.py
2023-08-06 17:06:38 -07:00
dijkstra_adj_matrix.py
👾
2023-07-30 21:40:09 -07:00
matrix_bfs.py
Create matrix_bfs.py
2023-08-01 15:21:20 -07:00
matrix_dfs_and_bfs.py
Create matrix_dfs_and_bfs.py
2023-08-01 16:20:00 -07:00
README.md
Update README.md
2023-08-03 20:31:19 -07:00

README.md

graphs


  • graph is a non-linear data structure consisting of vertices and edges.
  • in undirected graphs, the edges between any two vertices do not have a direction, indicating a two-way relationship.
  • in directed graphs, the edges between any two vertices are directional.
  • in weighted graphs, each edge has an associated weight. if the sum of the weights of all edges of a cycle is a negative values, it's a negative weight cycle.
  • the degree of a vertex is the number of edges connecting the vertex. in directed, graphs, if the in-dregree of a vertex is d, there are d directional edges incident to the vertex (and similarly, out-degree from the vertex).

traversals