# graph_from_edgelist: Create a graph from an edge list matrix In igraph: Network Analysis and Visualization

## 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``` ```graph_from_edgelist(el, directed = TRUE) from_edgelist(...) ```

## 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.

Other determimistic constructors: `graph_from_atlas()`, `graph_from_literal()`, `make_chordal_ring()`, `make_empty_graph()`, `make_full_citation_graph()`, `make_full_graph()`, `make_graph()`, `make_lattice()`, `make_ring()`, `make_star()`, `make_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):
 foo->bar    bar->foobar
IGRAPH D--- 10 10 --
+ edges:
  1-> 2  2-> 3  3-> 4  4-> 5  5-> 6  6-> 7  7-> 8  8-> 9  9->10 10-> 1
```

igraph documentation built on Oct. 15, 2021, 5:06 p.m.