Description Usage Arguments Details Value Examples

Computes the average shortest path length (aspl) using `igraph`

's automatic
method.

1 |

`adj` |
numeric matrix representing the adjacency matrix. |

`types` |
character. Either |

`weights` |
numeric vector of edge weights. Optional. |

`mode` |
character, either |

Per default the uncorrected apsl is computed. Otherwise, the uncorrected aspl
is normalized by `log(n nodes)/log(average degree)`

, i.e., the expected
average shortest path length for an Erdös-Renyi random graph.

Local clustering coefficient.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 | ```
# get fluency data
data(animal_fluency)
# edge lists of fluency graphs
edge_list = threshold_graph(animal_fluency)
# get adjacency matrices
adj = edg_to_adj(edge_list)
# get average shortest path length
aspl(adj)
# get corrected average shortest path length
aspl(adj, types = 'corrected')
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.