conversion {igraph}R Documentation

Convert a graph to an adjacency matrix or an edge list

Description

Sometimes it is useful to have a standard representation of a graph, like an adjacency matrix or an edge list.

Usage

get.adjacency(graph, type="both")
get.edgelist(graph)

Arguments

graph The graph to convert.
type Gives how to create the adjacency matrix for undirected graphs. It is ignored for directed graphs. Possible values: upper: the upper right triangle of the matrix is used, lower: the lower left triangle of the matrix is used. both: the whole matrix is used, a symmetric matrix is returned.

Details

get.adjacency returns the adjacency matrix of a graph.

get.edgelist returns the list of edges in a graph.

Value

A vcount(graph) by vcount(graph) numeric matrix for get.adjacency. (This can be huge!)
A ecount(graph) by 2 numeric matrix for get.edgelist.

Author(s)

Gabor Csardi csardi@rmki.kfki.hu

See Also

graph.adjacency, read.graph

Examples

g <- erdos.renyi.game(10, 2/10)
get.adjacency(g)
get.edgelist(g)

[Package igraph version 0.2.1 Index]