-
-
Notifications
You must be signed in to change notification settings - Fork 203
/
Copy pathdelete_edges.Rd
63 lines (60 loc) · 1.51 KB
/
delete_edges.Rd
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/interface.R
\name{delete_edges}
\alias{delete_edges}
\alias{delete.edges}
\title{Delete edges from a graph}
\usage{
delete_edges(graph, edges)
}
\arguments{
\item{graph}{The input graph.}
\item{edges}{The edges to remove, specified as an edge sequence. Typically
this is either a numeric vector containing edge IDs, or a character vector
containing the IDs or names of the source and target vertices, separated by
\code{|}}
}
\value{
The graph, with the edges removed.
}
\description{
Delete edges from a graph
}
\examples{
g <- make_ring(10) \%>\%
delete_edges(seq(1, 9, by = 2))
g
g <- make_ring(10) \%>\%
delete_edges("10|1")
g
g <- make_ring(5)
g <- delete_edges(g, get.edge.ids(g, c(1, 5, 4, 5)))
g
}
\seealso{
Other functions for manipulating graph structure:
\code{\link{+.igraph}()},
\code{\link{add_edges}()},
\code{\link{add_vertices}()},
\code{\link{complementer}()},
\code{\link{compose}()},
\code{\link{connect}()},
\code{\link{contract}()},
\code{\link{delete_vertices}()},
\code{\link{difference.igraph}()},
\code{\link{difference}()},
\code{\link{disjoint_union}()},
\code{\link{edge}()},
\code{\link{igraph-minus}},
\code{\link{intersection.igraph}()},
\code{\link{intersection}()},
\code{\link{path}()},
\code{\link{permute}()},
\code{\link{rep.igraph}()},
\code{\link{reverse_edges}()},
\code{\link{simplify}()},
\code{\link{union.igraph}()},
\code{\link{union}()},
\code{\link{vertex}()}
}
\concept{functions for manipulating graph structure}