Implement bct.kcoreness_centrality_wu

Hey, so far k-coreness calculation has been implemented for binary directed and undirected graphs. Wonder if it would be possible to also implement it for weighted undirected ones? :)