1 of 9
Download to read offline
![最短経路の発見
s2021 <- get.all.shortest.paths(g, "s63", "s2021")
s202 <- get.all.shortest.paths(g, "s63", "s202")
V(g)[s2021$res[[1]]]
> Vertex sequence: [1] "s63" "s2021"
V(g)[s202$res[[1]]]
> Vertex sequence: [1] "s63" "35" "s202"
みらくる
プレゼント
チャーハン
きゅうきょく
¥10000](https://image.slidesharecdn.com/kober7igraph-140802203543-phpapp01/85/Kober-R-7-igraph-8-320.jpg)
Kober.R #7 igraph
- 2. データ前処理
- 5. 次数分布
- 6. 次数分布 （次数中心性） deg <- degree(g)
- 8. 最短経路の発見 s2021 <- get.all.shortest.paths(g, "s63", "s2021") s202 <- get.all.shortest.paths(g, "s63", "s202") V(g)[s2021$res[[1]]] > Vertex sequence: [1] "s63" "s2021" V(g)[s202$res[[1]]] > Vertex sequence: [1] "s63" "35" "s202" みらくる プレゼント チャーハン きゅうきょく ¥10000