R/shortesttimepath.R

In timeordered: Time-Ordered and Time-Aggregated Network Analyses

shortesttimepath <-
function(g, startvertexname, startvertextime, stopvertexname)
{
	if (length(startvertexname) != 1 | length(stopvertexname) != 1)
	{
		stop("must provide single startvertex and stop vertex")	
	}
	startvertex <- V(g)[V(g)$Name==startvertexname & V(g)$Time==startvertextime]
	stopvertices <- V(g)[V(g)$Name==stopvertexname & V(g)$Time>=startvertextime]	
	paths <- get.shortest.paths(g, startvertex, stopvertices, mode="out", weights=E(g)$TimeCost)
        if (is.list(paths) && "vpath" %in% names(paths)) { paths <- paths$vpath }
	
	shortestpath  <- paths[[which.min(lapply(paths, function(x) { tail(V(g)[x]$Time,1) })) ]]
	return(V(g)[shortestpath])
}