iteratePaths: Calculates the shortest path between two actor types

In toledobastos/iterateNetwork: Simulation and iteration over network projections

Description

Description: The function iteratePaths computes the shortest path between two groups of actors by iteratively removing the other groups.

Usage

iteratePaths(net.object, attribute="orgsector", from.node.group="EDU", to.node.group="IGOV", stepwise.removal=1)

Arguments

net.object	The network object. Accepts both igraph and network objects
iteration.type	Defaults to "shortest.path"
from.node.group	Starting group from which to calculate the shortest path
to.node.group	Ending group from which to calculate the shortest path
plot.type	Select variable to plot. Accepts shortest.path or harmonic.path

Author(s)

Marco T. Bastos

Examples

# Not run:
net.object <- watts.strogatz.game(1, 300, 4, 0.01)
V(net.object)$group <- sample(rep(LETTERS[c(1,4,6,8,4,20)],1000),100)
iteratePaths(net.object, attribute="group", from.node.group="A", to.node.group="T", stepwise.removal=1)

toledobastos/iterateNetwork documentation built on May 31, 2019, 5:14 p.m.