File: ends.Rd

package info (click to toggle)
r-cran-igraph 2.1.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 27,044 kB
  • sloc: ansic: 204,981; cpp: 21,711; fortran: 4,090; yacc: 1,229; lex: 519; sh: 52; makefile: 8
file content (44 lines) | stat: -rw-r--r-- 995 bytes parent folder | download
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
39
40
41
42
43
44
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/interface.R
\name{ends}
\alias{ends}
\alias{get.edges}
\title{Incident vertices of some graph edges}
\usage{
ends(graph, es, names = TRUE)
}
\arguments{
\item{graph}{The input graph}

\item{es}{The sequence of edges to query}

\item{names}{Whether to return vertex names or
numeric vertex ids. By default vertex names are used.}
}
\value{
A two column matrix of vertex names or vertex ids.
}
\description{
Incident vertices of some graph edges
}
\examples{
g <- make_ring(5)
ends(g, E(g))
}
\seealso{
Other structural queries: 
\code{\link{[.igraph}()},
\code{\link{[[.igraph}()},
\code{\link{adjacent_vertices}()},
\code{\link{are_adjacent}()},
\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}()},
\code{\link{tail_of}()}
}
\concept{structural queries}