root / latex / note_w13.tex @ 4ca27bae
History | View | Annotate | Download (1008 Bytes)
1 |
%!TEX root = note.tex |
---|---|
2 |
|
3 |
%%%%%%%%%%%%%%%%%% |
4 |
% WEEK 13 |
5 |
%%%%%%%%%%%%%%%%%% |
6 |
\section{Week 13} |
7 |
\subsection{Heuristic BC - biconnected components} |
8 |
Check out \textbf{report_dec_20.pdf} for more information. |
9 |
|
10 |
\subsubsection{Acronym} |
11 |
\textbf{NBC} = the BC from the library networkx |
12 |
|
13 |
\textbf{WBBC} = accummulate BC with the simplest \emph{Traffic Matrix} (1 for connected vertices, and 0 otherwise) |
14 |
|
15 |
\textbf{HBC} = accummulate BC with the Traffic Matrix described in the paper. |
16 |
|
17 |
\subsubsection{Result} |
18 |
There was a bug in Traffic Matrix. It has to do with the sorting. I should not assume that the list of vertices were sorted in the same way. |
19 |
|
20 |
\begin{lstlisting} |
21 |
sorted(biconnected_components[0]) |
22 |
|
23 |
sorted(G.nodes()) |
24 |
\end{lstlisting} |
25 |
|
26 |
Now the WBBC = HBC. (But I did not minus the BC_iter from the total sum of BC for cutpoint vertices.) |
27 |
|
28 |
And we have WBBC ~ NBC. |
29 |
|