1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/basic.R
\name{tail_of}
\alias{tail_of}
\title{Tails of the edge(s) in a graph}
\usage{
tail_of(graph, es)
}
\arguments{
\item{graph}{The input graph.}
\item{es}{The edges to query.}
}
\value{
A vertex sequence with the tail(s) of the edge(s).
}
\description{
For undirected graphs, head and tail is not defined. In this case
\code{tail_of()} returns vertices incident to the supplied edges, and
\code{head_of()} returns the other end(s) of the edge(s).
}
\seealso{
Other structural queries:
\code{\link{[.igraph}()},
\code{\link{[[.igraph}()},
\code{\link{adjacent_vertices}()},
\code{\link{are_adjacent}()},
\code{\link{ends}()},
\code{\link{get_edge_ids}()},
\code{\link{gorder}()},
\code{\link{gsize}()},
\code{\link{head_of}()},
\code{\link{incident}()},
\code{\link{incident_edges}()},
\code{\link{is_directed}()},
\code{\link{neighbors}()}
}
\concept{structural queries}
|
