CS 234

Update 3/13

Code to calculate betweenness centrality complete and tested. Other metrics coming soon.

Update 3/6

Using the highly-cited paper linked below as a reference for an efficient representation, I have completed planning and development is under way. I have currently completed the code to parse the files and represent the network as a hashmap of [node, vector-of-linked nodes] pairs for efficient access.

Update 2/24

I am now working on the protein-protein interaction graph problem. As the edges in the graph are unweighted, a modified version of BFS will suffice to compute the shortest paths needed to generate graph statistics. I found a useful reference to accelerate this process: