CLRS-type algorithms on sna/network

Question

[mk]

I began using R iGraph to compute things like minimum-spanning-trees, but iGraph plotting was unsatisfactory. My search for a ggplot2-based network visualization library led me to sna/network via ggnetwork, which can utilize iGraph objects only through implicit (buggy) conversion to sna/network objects. I would like to use network to replace iGraph in my package, and am wondering if anyone hasany advice on what library(s) to use for rudimentary graph calculations (ie ch. 22-26 of Cormen/Leiserson/Rivest/Stein)? Right now I need mst and single-point minimum distance calculations and these are not provided by network/sna