6.1. igraph_es_all — Edge set, all edges.

6.1. `igraph_es_all` — Edge set, all edges.

int igraph_es_all(igraph_es_t *es, 
		  igraph_edgeorder_type_t order);

Arguments:

es:

Pointer to an uninitialized edge selector object.

order:

Constant giving the order in which the edges will be included in the selector. Possible values: IGRAPH_EDGEORDER_ID, edge id order. IGRAPH_EDGEORDER_FROM, vertex id order, the id of the source vertex counts for directed graphs. The order of the adjacent edges of a given vertex is arbitrary. IGRAPH_EDGEORDER_TO, vertex id order, the id of the target vertex counts for directed graphs. The order of the adjacent edges of a given vertex is arbitrary. For undirected graph the latter two is the same.

Returns:

Error code.

See also:

igraph_ess_all()

Time complexity: O(1).