File: tail_of.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1%2Bdeb9u1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 18,232 kB
  • sloc: ansic: 173,538; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (34 lines) | stat: -rw-r--r-- 1,074 bytes parent folder | download | duplicates (2)
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
% Generated by roxygen2 (4.1.1): 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.connected}}, \code{\link{are_adjacent}};
  \code{\link{ecount}}, \code{\link{gsize}};
  \code{\link{ends}}, \code{\link{get.edge}},
  \code{\link{get.edges}}; \code{\link{get.edge.ids}};
  \code{\link{gorder}}, \code{\link{vcount}};
  \code{\link{head_of}}; \code{\link{incident_edges}};
  \code{\link{incident}}; \code{\link{is.directed}},
  \code{\link{is_directed}}; \code{\link{neighbors}}
}