# network v1.13.0

0

Monthly downloads

by Carter Butts

## Classes for Relational Data

Tools to create and modify network objects. The network class can represent a range of relational data types, and supports arbitrary vertex/edge/graph attributes.

## Functions in network

Name | Description | |

get.neighborhood | Obtain the Neighborhood of a Given Vertex | |

as.sociomatrix | Coerce One or More Networks to Sociomatrix Form | |

as.network.matrix | Coercion from Matrices to Network Objects | |

network.extraction | Extraction and Replacement Operators for Network Objects | |

deletion.methods | Remove Elements from a Network Object | |

network.edgelabel | Plots a label corresponding to an edge in a network plot. | |

network.operators | Network Operators | |

flo | Florentine Wedding Data (Padgett) | |

sum.network | Combine Networks by Edge Value Addition | |

network.arrow | Add Arrows or Segments to a Plot | |

network.layout | Vertex Layout Functions for plot.network | |

add.edges | Add Edges to a Network Object | |

edgeset.constructors | Edgeset Constructors for Network Objects | |

network.dyadcount | Return the Number of (Possibly Directed) Dyads in a Network Object | |

network.size | Return the Size of a Network | |

network.initialize | Initialize a Network Class Object | |

valid.eids | Get the ids of all the edges that are valid in a network | |

network.vertex | Add Vertices to a Plot | |

network | Network Objects | |

permute.vertexIDs | Permute (Relabel) the Vertices Within a Network | |

network-internal | Internal Network Package Functions | |

get.inducedSubgraph | Retrieve Induced Subgraphs and Cuts | |

network.density | Compute the Density of a Network | |

which.matrix.type | Heuristic Determination of Matrix Types for Network Storage | |

network.indicators | Indicator Functions for Network Properties | |

network-package | Classes for Relational Data | |

network.loop | Add Loops to a Plot | |

missing.edges | Identifying and Counting Missing Edges in a Network Object | |

plotArgs.network | Expand and transform attributes of networks to values appropriate for aguments to plot.network | |

plot.network.default | Two-Dimensional Visualization for Network Objects | |

is.adjacent | Determine Whether Two Vertices Are Adjacent | |

read.paj | Read a Pajek Project or Network File and Convert to an R 'Network' Object | |

loading.attributes | Examples of how to load vertex and edge attributes into networks | |

network.edgecount | Return the Number of Edges in a Network Object | |

add.vertices | Add Vertices to an Existing Network | |

as.edgelist | Convert a network object into a numeric edgelist matrix | |

has.edges | Determine if specified vertices of a network have any edges (are not isolates) | |

as.color | Transform vector of values into color specification | |

attribute.methods | Attribute Interface Methods for the Network Class | |

get.edges | Retrieve Edges or Edge IDs Associated with a Given Vertex | |

prod.network | Combine Networks by Edge Value Multiplication | |

emon | Interorganizational Search and Rescue Networks (Drabek et al.) | |

as.matrix.network | Coerce a Network Object to Matrix Form | |

No Results! |

## Last month downloads

## Details

Date | 2015-08-31 |

License | GPL (>= 2) |

URL | http://statnet.org/ |

NeedsCompilation | yes |

Packaged | 2015-09-15 12:24:10 UTC; rpackagebuilder |

Repository | CRAN |

Date/Publication | 2015-09-19 22:13:50 |

depends | base (>= 2.10) , R (>= 2.10) , utils |

suggests | sna , statnet , statnet.common , testthat |

Contributors | Skye BenderdeMoll, Mark S Handcock, Carter Butts, David Hunter, Jeffrey Horner |

#### Include our badge in your README

```
[![Rdoc](http://www.rdocumentation.org/badges/version/network)](http://www.rdocumentation.org/packages/network)
```