Produces a summary of network properties and returns graph components (ordered by decreasing size), without self-loops.
properties(graph, data = NULL, ...)
List of graph components, ordered by decreasing size (the first component is the giant one), without self-loops.
# Extract the "Type II diabetes mellitus" pathway:
g <- kegg.pathways[["Type II diabetes mellitus"]]
summary(g)
#> IGRAPH 218cd1b DNW- 47 130 --
#> + attr: name (v/c), weight (e/n)
properties(g)
#> Frequency distribution of graph components
#>
#> n.nodes n.graphs
#> 1 7 1
#> 2 39 1
#>
#> Percent of vertices in the giant component: 83 %
#>
#> is.simple is.dag is.directed is.weighted
#> TRUE FALSE TRUE TRUE
#>
#> which.mutual.FALSE
#> 120
#> [[1]]
#> IGRAPH b12a2a0 DNW- 39 120 --
#> + attr: name (v/c), weight (e/n)
#> + edges from b12a2a0 (vertex names):
#> [1] 110117499->6517 110117499->2475 110117499->5590
#> [4] 5290 ->6517 5290 ->2475 5290 ->5590
#> [7] 5291 ->6517 5291 ->2475 5291 ->5590
#> [10] 5293 ->6517 5293 ->2475 5293 ->5590
#> [13] 5295 ->6517 5295 ->2475 5295 ->5590
#> [16] 5296 ->6517 5296 ->2475 5296 ->5590
#> [19] 8503 ->6517 8503 ->2475 8503 ->5590
#> [22] 3667 ->110117499 3667 ->5290 3667 ->5291
#> + ... omitted several edges
#>
#> [[2]]
#> IGRAPH b12a23e DNW- 7 10 --
#> + attr: name (v/c), weight (e/n)
#> + edges from b12a23e (vertex names):
#> [1] 2645 ->5313 2645 ->5315 3098 ->5313 3098 ->5315 3099 ->5313 3099 ->5315
#> [7] 3101 ->5313 3101 ->5315 80201->5313 80201->5315
#>