File: incident_edges.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 (41 lines) | stat: -rw-r--r-- 1,243 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
35
36
37
38
39
40
41
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/interface.R
\name{incident_edges}
\alias{incident_edges}
\title{Incident edges of multiple vertices in a graph}
\usage{
incident_edges(graph, v, mode = c("out", "in", "all", "total"))
}
\arguments{
\item{graph}{Input graph.}

\item{v}{The vertices to query}

\item{mode}{Whether to query outgoing (\sQuote{out}), incoming
(\sQuote{in}) edges, or both types (\sQuote{all}). This is
ignored for undirected graphs.}
}
\value{
A list of edge sequences.
}
\description{
This function is similar to \code{\link{incident}}, but it
queries multiple vertices at once.
}
\examples{
g <- make_graph("Zachary")
incident_edges(g, c(1, 34))
}
\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}};
  \code{\link{is.directed}}, \code{\link{is_directed}};
  \code{\link{neighbors}}; \code{\link{tail_of}}
}