graph_from_edgelist: Create a graph from an edge list matrix

Description Usage Arguments Value See Also Examples

View source: R/data_frame.R

Description

graph_from_edgelist creates a graph from an edge list. Its argument is a two-column matrix, each row defines one edge. If it is a numeric matrix then its elements are interpreted as vertex ids. If it is a character matrix then it is interpreted as symbolic vertex names and a vertex id will be assigned to each name, and also a name vertex attribute will be added.

Usage

1
2
3

Arguments

el

The edge list, a two column matrix, character or numeric.

directed

Whether to create a directed graph.

...

Passed to graph_from_edgelist.

Value

An igraph graph.

See Also

Other determimistic constructors: atlas, graph.atlas, graph_from_atlas; chordal_ring, graph.extended.chordal.ring, make_chordal_ring; directed_graph, graph, graph.famous, make_directed_graph, make_graph, make_undirected_graph, undirected_graph; empty_graph, graph.empty, make_empty_graph; from_literal, graph.formula, graph_from_literal; full_citation_graph, graph.full.citation, make_full_citation_graph; full_graph, graph.full, make_full_graph; graph.lattice, lattice, make_lattice; graph.ring, make_ring, ring; graph.star, make_star, star; graph.tree, make_tree, tree

Examples

1
2
3
4
5
el <- matrix( c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
graph_from_edgelist(el)

# Create a ring by hand
graph_from_edgelist(cbind(1:10, c(2:10, 1)))

Example output

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

IGRAPH DN-- 3 2 -- 
+ attr: name (v/c)
+ edges (vertex names):
[1] foo->bar    bar->foobar
IGRAPH D--- 10 10 -- 
+ edges:
 [1]  1-> 2  2-> 3  3-> 4  4-> 5  5-> 6  6-> 7  7-> 8  8-> 9  9->10 10-> 1

igraph documentation built on May 30, 2017, 2:56 a.m.

Search within the igraph package
Search all R packages, documentation and source code