Version 2.7 includes the following new functions:

• none yet

It also includes improved versions of the following functions:

• closeness_w: Can now calculate non-infinite values for nodes in networks with disconnected components (specify gconly=FALSE). See this blog post.
• distance_w/_tm and betweenness_w: Are now based on the igraph package and much faster + memory efficient.

If you have any suggestions, let me know!

UPDATE

The distance functions (distance_, closeness_w, and betweenness_w) did not correctly work on directed networks. Paths are supposed to be following the directed ties; however, the strongly connected component was symmetrised during the path identifications. This has now been corrected in version 2.7.1.