mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Update README.md
This commit is contained in:
parent
0e5c36f426
commit
a2f5521bd3
@ -2,6 +2,15 @@
|
|||||||
|
|
||||||
<br>
|
<br>
|
||||||
|
|
||||||
|
* 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).
|
||||||
|
|
||||||
|
<br>
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
### traversals
|
### traversals
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user