The shortest path length, or geodesic distance, between two nodes in a binary network is the minimum number of steps you need to make to go from one of them to the other. See the distance_w-function for more details.

1 | ```
distance_tm(net, projection.method="sum", gconly=TRUE,subsample=1, seed=NULL)
``` |

`net` |
A two-mode network |

`projection.method` |
The way the two-mode network is projected. The sum method defines tie weights as the number of common nodes (e.g., events, projects etc) that two individuals had contact through. In certain cases, "Newman" might be better. See the projecting_tm-function. |

`gconly` |
logical, whether the function should only be calculated for the giant component. Default is TRUE. |

`subsample` |
Whether a only a subset of starting nodes should we used when calculating the measure. This is particularly useful when running out of memory analysing large networks. If it is set to 1, all distances are analysed. If it set to a value below one, this is roughly the proportion of starting noes that will be analysed. If it is set to an interger greater than 1, this number of starting nodes that will be analysed. |

`seed` |
If a subset of starting nodes is analysed, by setting this parameter, the results are reproducable. |

Returns a distance matrix.

version 1.0.0

Tore Opsahl; http://toreopsahl.com

http://toreopsahl.com/2009/01/09/average-shortest-distance-in-weighted-networks/

1 2 3 4 5 6 7 8 | ```
# Load networks
net <- cbind(
i=c(1,1,2,2,2,3,3,4,5,5,6),
p=c(1,2,1,3,4,2,3,4,3,5,5),
w=c(3,5,6,1,2,6,2,1,3,1,2))
# Run the function
distance_tm(net)
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.