%!TEX root = note.tex
%%%%%%%%%%%%%%%%%%
% WEEK 1
%%%%%%%%%%%%%%%%%%
\section{Week 1}
\subsection{Brandes 2001}
\subsubsection{Counting the number of shortest paths}
Explanation on k-th power of the adjacency matrix equals the number of paths from vertex \texttt{u} to vertex \texttt{v} \footnote{https://www.quora.com/What-is-an-intuitive-explanation-for-why-raising-an-adjacency-matrix-to-the-power-of-n-gives-a-new-matrix-with-the-number-of-n-paths}
\textbf{Floyd/Warshall algorithm}
\subsubsection{Code for shortest-path betweenness centrality}
https://github.com/networkx/networkx/blob/master/networkx/algorithms/centrality/betweenness.py
Line 116
\begin{itemize}
\item S
\item P
\item sigma
\end{itemize}
$c_B(v) =\sum_{s,t \in V} \frac{\sigma(s, t|v)}{\sigma(s, t)}$