Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Typos

Browse Source
This commit is contained in:
Mark
2023-12-09 18:17:22 -08:00
parent a5362a2eb9
commit 6a5e02a8ac
27 changed files with 36 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Advanced/Graph Algorithms/parts/01 flow.tex
View File

@ -5,7 +5,7 @@ Say have a network: a sequence of pipes, a set of cities and highways, an electr
\vspace{1ex}
We can draw this network as a directed weighted graph. If we take a transporation network, for example, edges will represent highways and nodes will be cities. There are a few conditions for a valid network graph:
We can draw this network as a directed weighted graph. If we take a transportation network, for example, edges will represent highways and nodes will be cities. There are a few conditions for a valid network graph:
\begin{itemize}
\item The weight of each edge represents its capacity, e.g, the number of lanes in the highway.