commit d6bd4190055b18f040996831a3391498385b1279
parent b515846b771638f5943a8d055c96b3bb2f575e39
Author: miksa234 <milutin@popovic.xyz>
Date: Sun, 10 Oct 2021 17:32:11 +0200
fix typos sehs1
Diffstat:
2 files changed, 7 insertions(+), 8 deletions(-)
diff --git a/sesh1/tex/main.pdf b/sesh1/tex/main.pdf
Binary files differ.
diff --git a/sesh1/tex/main.tex b/sesh1/tex/main.tex
@@ -291,18 +291,17 @@ experience for an undirected network, a directed network and a network with
edge weights.(3 pts)
\newline
-\textbf{Solution 3:} An example for an undirected network would be an social
-graph, meaning graphing who is friends with who like Facebook. The vertices
-would be people and the edges would be friend connections.
+\textbf{Solution 3:} An example for an undirected network is a social
+network. Just like Facebook, the vertices are people and the edges are friend connections.
\newline
- An example for a directed network would be the World Wide Web, where the
+ An example for a directed network is the World Wide Web, where the
vertices are the websites and edges are hyperlinks which are directed to a
website.
\newline
- An example for a network with edge weights would be a graph representing a
- coin flip graph ($p=\frac{1}{2}$) or a dice throw graph ($p=\frac{1}{6}$).
+ An example for a network with edge weights would be a graph representing
+ coin flips ($p=\frac{1}{2}$) or a dice throws ($p=\frac{1}{6}$).
\textbf{Exercise 4:} Walk through the notebook tutorial\_1 and solve the
embedded exercises (3x4pts).
@@ -310,10 +309,10 @@ embedded exercises (3x4pts).
\textbf{Solution 4:}
Code can be pulled from my git instance \cite{code}, a copy is also shown
-below.
+below and handed in in moodle.
\begin{minted}{python}
# EX 1:
-get_leaves = lambda G: [node for node, degree in G.degree() if degree==1]
+get_leaves = lambda G: [node for node, degree in G.degree() if degree == 1]
# EX 2:
def max_degree(G):
m = max(G.degree(), key = lambda x: x[1])[1]
