Relationer mellan noder

Nätverksanalys i R

James Curley

Associate Professor, University of Texas at Austin

Identifiera grannar

neighbors(g, "F", mode = c("all"))
+ 5/12 vertices, named:
[1] A E G H I
Nätverksanalys i R

Identifiera gemensamma grannar

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

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

intersection(x,y)
A
Nätverksanalys i R

Vägar

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
Nätverksanalys i R

Identifiera noder nåbara på N steg

ego(g, 2, 'F', mode=c('out'))
+ 5/12 vertices, named:
[1] F A E G H
Nätverksanalys i R

Nu kör vi en övning!

Nätverksanalys i R

Preparing Video For Download...