Package: network 1.19.0
Carter T. Butts
network: 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.
Authors:
network_1.19.0.tar.gz
network_1.19.0.tar.gz(r-4.5-noble)network_1.19.0.tar.gz(r-4.4-noble)
network_1.19.0.tgz(r-4.4-emscripten)network_1.19.0.tgz(r-4.3-emscripten)
network.pdf |network.html✨
network/json (API)
| # Install 'network' in R: |
| install.packages('network', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated 9 days agofrom:75bfb904f9. Checks:OK: 2. Indexed: yes.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Dec 09 2024 |
| R-4.5-linux-x86_64 | OK | Dec 09 2024 |
Exports:-.network!.network[.network[<-.network*.network&.network%c%%c%.network%e%%e%<-%eattr%%eattr%<-%n%%n%<-%nattr%%nattr%<-%s%%v%%v%<-%vattr%%vattr%<-+.network<-.network|.networkadd.edgeadd.edge.networkadd.edgesadd.edges.networkadd.verticesadd.vertices.networkas.coloras.data.frame.networkas.edgelistas.edgelist.matrixas.matrix.networkas.matrix.network.adjacencyas.matrix.network.edgelistas.matrix.network.incidenceas.networkas.network.data.frameas.network.defaultas.network.matrixas.network.networkas.sociomatrixdelete.edge.attributedelete.edgesdelete.network.attributedelete.vertex.attributedelete.verticesget.dyads.eidsget.edge.attributeget.edge.valueget.edgeIDsget.edgesget.inducedSubgraphget.neighborhoodget.network.attributeget.vertex.attributehas.edgeshas.loopsis.adjacentis.bipartiteis.coloris.directedis.discreteis.discrete.characteris.discrete.numericis.edgelistis.hyperis.multiplexis.na.networkis.networklist.edge.attributeslist.network.attributeslist.vertex.attributesmixingmatrixnetworknetwork.adjacencynetwork.arrownetwork.bipartitenetwork.copynetwork.densitynetwork.dyadcountnetwork.edgecountnetwork.edgelabelnetwork.edgelistnetwork.incidencenetwork.initializenetwork.layout.circlenetwork.layout.fruchtermanreingoldnetwork.layout.kamadakawainetwork.loopnetwork.naedgecountnetwork.sizenetwork.vertexnetwork.vertex.namesnetwork.vertex.names<-permute.vertexIDsplot.networkplot.network.defaultplotArgs.networkprint.networkprint.summary.networkprod.networkread.pajset.edge.attributeset.edge.valueset.network.attributeset.vertex.attributesum.networksummary.networkvalid.eidswhich.matrix.type
Dependencies:clicodafansigluelatticelifecyclemagrittrMatrixpillarpkgconfigrlangstatnet.commontibbleutf8vctrs
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Classes for Relational Data | network-package |
| Add Edges to a Network Object | add.edge add.edge.network add.edges add.edges.network |
| Add Vertices to an Existing Network | add.vertices add.vertices.network |
| Transform vector of values into color specification | as.color is.color |
| Coerce a Network Object to a 'data.frame' | as.data.frame.network |
| Convert a network object into a numeric edgelist matrix | as.edgelist as.edgelist.matrix as.edgelist.network as.edgelist.tbl_df edgelist is.edgelist |
| Coerce a Network Object to Matrix or Table Form | as.matrix.network as.matrix.network.adjacency as.matrix.network.edgelist as.matrix.network.incidence as.tibble.network as_tibble.network |
| Coercion from Matrices to Network Objects | as.network.default as.network.matrix |
| Coerce One or More Networks to Sociomatrix Form | as.sociomatrix |
| Attribute Interface Methods for the Network Class | attribute.methods delete.edge.attribute delete.edge.attribute.network delete.network.attribute delete.network.attribute.network delete.vertex.attribute delete.vertex.attribute.network get.edge.attribute get.edge.attribute.list get.edge.attribute.network get.edge.value get.edge.value.list get.edge.value.network get.network.attribute get.network.attribute.network get.vertex.attribute get.vertex.attribute.network list.edge.attributes list.edge.attributes.network list.network.attributes list.network.attributes.network list.vertex.attributes list.vertex.attributes.network network.vertex.names network.vertex.names<- set.edge.attribute set.edge.attribute.network set.edge.value set.edge.value.network set.network.attribute set.network.attribute.network set.vertex.attribute set.vertex.attribute.network |
| Remove Elements from a Network Object | delete.edges delete.edges.network delete.vertices delete.vertices.network deletion.methods |
| Edgeset Constructors for Network Objects | edgeset.constructors network.adjacency network.bipartite network.edgelist network.incidence |
| Interorganizational Search and Rescue Networks (Drabek et al.) | emon |
| Florentine Wedding Data (Padgett) | flo |
| Retrieve Edges or Edge IDs Associated with a Given Vertex | get.dyads.eids get.edgeIDs get.edges |
| Retrieve Induced Subgraphs and Cuts | %s% get.inducedSubgraph get.inducedSubgraph.network |
| Obtain the Neighborhood of a Given Vertex | get.neighborhood |
| Determine if specified vertices of a network have any edges (are not isolates) | has.edges is.isolate |
| Determine Whether Two Vertices Are Adjacent | is.adjacent |
| Examples of how to load vertex and edge attributes into networks | loading.attributes |
| Identifying and Counting Missing Edges in a Network Object | is.na.network missing.edges network.naedgecount |
| Mixing matrix | $.mixingmatrix is.bipartite.mixingmatrix is.directed.mixingmatrix mixingmatrix mixingmatrix.network print.mixingmatrix [[.mixingmatrix |
| Network Objects | $<-.network <-.network as.network as.network.data.frame as.network.network is.network network network.copy print.network print.summary.network summary.network |
| Add Arrows or Segments to a Plot | network.arrow |
| Compute the Density of a Network | network.density |
| Return the Number of (Possibly Directed) Dyads in a Network Object | network.dyadcount network.dyadcount.network |
| Return the Number of Edges in a Network Object | network.edgecount network.edgecount.network |
| Plots a label corresponding to an edge in a network plot. | network.edgelabel |
| Extraction and Replacement Operators for Network Objects | %e% %e%<- %eattr% %eattr%<- %n% %n%<- %nattr% %nattr%<- %v% %v%<- %vattr% %vattr%<- network.extraction [.network [<-.network |
| Indicator Functions for Network Properties | has.loops is.bipartite is.bipartite.network is.directed is.directed.network is.hyper is.multiplex network.indicators |
| Initialize a Network Class Object | network.initialize |
| Vertex Layout Functions for plot.network | network.layout network.layout.circle network.layout.fruchtermanreingold network.layout.kamadakawai |
| Add Loops to a Plot | network.loop |
| Network Operators | !.network %c% %c%.network &.network *.network +.network -.network network.operators |.network |
| Return the Size of a Network | network.size |
| Add Vertices to a Plot | network.vertex |
| Permute (Relabel) the Vertices Within a Network | permute.vertexIDs permute.vertexIDs.network |
| Two-Dimensional Visualization for Network Objects | plot.network plot.network.default |
| Expand and transform attributes of networks to values appropriate for aguments to plot.network | plotArgs.network |
| Combine Networks by Edge Value Multiplication | prod.network |
| Read a Pajek Project or Network File and Convert to an R 'Network' Object | read.paj read.paj.simplify readAndVectorizeLine switchArcDirection |
| Combine Networks by Edge Value Addition | sum.network |
| Get the ids of all the edges that are valid in a network | valid.eids valid.eids.network |
| Heuristic Determination of Matrix Types for Network Storage | which.matrix.type |