顶点之间的关系

R 中的网络分析

James Curley

Associate Professor, University of Texas at Austin

识别邻接点

neighbors(g, "F", mode = c("all"))

+ 5/12 vertices, named:
[1] A E G H I

x <- neighbors(
  g, "F", mode = c("all")
)

y <- neighbors(
  g, "D", mode = c("all")
)

intersection(x,y)

farthest_vertices(g)

$vertices
+ 2/12 vertices, named:
[1] J G

$distance
[1] 6

get_diameter(g)

+ 7/12 vertices, named:
[1] J D A E H F G

ego(g, 2, 'F', mode=c('out'))

+ 5/12 vertices, named:
[1] F A E G H

R 中的网络分析