eggy/eifueo
1
1
Fork 1
Code Issues 2 Pull Requests Releases Wiki Activity

ece250: add dags

Browse Source
This commit is contained in:
eggy 2023-11-14 14:30:25 -05:00
parent f9a2115408
commit 90df8ccf04
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/2a/ece250.md
View File

@ -158,3 +158,7 @@ fn sort(A: Vec) {
- A **connected graph** is such that there exists a path from any node in the graph to any other node.
- A **connected component** is a subgraph such that there exists a path from any node in the subgraph to any other node in the subgraph.
- A **tree** is a connected graph without cycles.
### Directed acyclic graphs
a DAG is acyclic if and only if there are no **back edges** — edges from a child to an ancestor.