Package index
-
add.edge()add.edges() - Add Edges to a Network Object
-
add.vertices() - Add Vertices to an Existing Network
-
as.color()is.color() - Transform vector of values into color specification
-
as.data.frame(<network>) - Coerce a Network Object to a
data.frame -
as.edgelist(<network>)as.edgelist(<matrix>)as.edgelist(<tbl_df>)is.edgelist() - Convert a network object into a numeric edgelist matrix
-
as.matrix(<network>)as.matrix.network(<adjacency>)as.matrix.network(<edgelist>)as_tibble(<network>)as.tibble.network()as.matrix.network(<incidence>) - Coerce a Network Object to Matrix or Table Form
-
as.network(<default>)as.network(<matrix>) - Coercion from Matrices to Network Objects
-
as.sociomatrix() - Coerce One or More Networks to Sociomatrix Form
-
delete.edge.attribute()delete.network.attribute()delete.vertex.attribute()get.edge.attribute()get.edge.value()get.network.attribute()get.vertex.attribute()list.edge.attributes()list.network.attributes()list.vertex.attributes()network.vertex.names()`network.vertex.names<-`()set.edge.attribute()set.edge.value()set.network.attribute()set.vertex.attribute() - Attribute Interface Methods for the Network Class
-
delete.edges()delete.vertices() - Remove Elements from a Network Object
-
network.bipartite()network.adjacency()network.edgelist()network.incidence() - Edgeset Constructors for Network Objects
-
emon - Interorganizational Search and Rescue Networks (Drabek et al.)
-
flo - Florentine Wedding Data (Padgett)
-
get.edgeIDs()get.edges()get.dyads.eids() - Retrieve Edges or Edge IDs Associated with a Given Vertex
-
get.inducedSubgraph()`%s%` - Retrieve Induced Subgraphs and Cuts
-
get.neighborhood() - Obtain the Neighborhood of a Given Vertex
-
has.edges() - Determine if specified vertices of a network have any edges (are not isolates)
-
is.adjacent() - Determine Whether Two Vertices Are Adjacent
-
loading.attributes - Examples of how to load vertex and edge attributes into networks
-
mixingmatrix()`[[`(<mixingmatrix>)`$`(<mixingmatrix>)is.directed(<mixingmatrix>)is.bipartite(<mixingmatrix>)print(<mixingmatrix>) - Mixing matrix
-
`+`(<network>)`-`(<network>)`*`(<network>)`!`(<network>)`|`(<network>)`&`(<network>)`%c%`(<network>) - Network Operators
-
network-package - Classes for Relational Data
-
is.network()as.network()network()network.copy()print(<network>)summary(<network>) - Network Objects
-
network.arrow() - Add Arrows or Segments to a Plot
-
network.density() - Compute the Density of a Network
-
network.dyadcount(<network>) - Return the Number of (Possibly Directed) Dyads in a Network Object
-
network.edgecount(<network>) - Return the Number of Edges in a Network Object
-
network.edgelabel() - Plots a label corresponding to an edge in a network plot.
-
`[`(<network>)`[<-`(<network>)`%e%``%e%<-`()`%eattr%``%eattr%<-`()`%n%``%n%<-`()`%nattr%``%nattr%<-`()`%v%``%v%<-`()`%vattr%``%vattr%<-`() - Extraction and Replacement Operators for Network Objects
-
has.loops()is.bipartite()is.directed()is.hyper()is.multiplex() - Indicator Functions for Network Properties
-
network.initialize() - Initialize a Network Class Object
-
network.layout.circle()network.layout.fruchtermanreingold()network.layout.kamadakawai() - Vertex Layout Functions for plot.network
-
network.loop() - Add Loops to a Plot
-
is.na(<network>)network.naedgecount() - Identifying and Counting Missing Edges in a Network Object
-
network.size() - Return the Size of a Network
-
network.vertex() - Add Vertices to a Plot
-
permute.vertexIDs() - Permute (Relabel) the Vertices Within a Network
-
plot(<network>)plot.network(<default>) - Two-Dimensional Visualization for Network Objects
-
plotArgs.network() - Expand and transform attributes of networks to values appropriate for aguments to plot.network
-
prod(<network>) - Combine Networks by Edge Value Multiplication
-
read.paj() - Read a Pajek Project or Network File and Convert to an R 'Network' Object
-
sum(<network>) - Combine Networks by Edge Value Addition
-
valid.eids() - Get the ids of all the edges that are valid in a network
-
which.matrix.type() - Heuristic Determination of Matrix Types for Network Storage