08/08/2011 update: This program has been superseded by SGL 1.1.4.
07/26/2011 update: Version 1.1.3 uploaded. Under review at the Stata Journal. Dijkstra's algorithm for weighted networks revamped with code now based on pseudocode available on Boost Graph Library (BGL)'s website. Algorithm to compute betweenness centrality for weighted networks also changed to be based on Brandes' algorithm. Both implementations cut computation time by half or more, depending on the size and density of network. Still slower than BGL, but improving. Documentation with revised examples also included. Please let me know of any errors, concerns, inconsistencies, etc. Thank you!