intergraph-package: Coercion Routines for Network Data Objects

In intergraph: Coercion Routines for Network Data Objects

Coercion Routines for Network Data Objects

Description

This package contains methods for coercion between various classes used to represent network data in R.

Details

Functions implemented in this package allow to coerce (i.e. convert) network data between classes provided by other R packages. Currently supported classes are: "network" from package network, "igraph" from package igraph.

The main functions are:

• asNetwork and its methods to create objects of class "network".

• asIgraph and its methods to create objects of class "igraph".

See their help pages for more information and examples.

As all the supported packages are written using S3 methods, so are the methods in this package.

If you find this package useful in your work please cite it. Type citation(package="intergraph") for the information how to do that.

Author(s)

Written and maintained by Michal Bojanowski [e-mail].

See Also

Useful links:

• https://mbojan.github.io/intergraph/

• Report bugs at https://github.com/mbojan/intergraph/issues

Examples

# example of converting objects between classes 'network' and 'igraph'
# needs packages igraph and network attached
if( require(network) & require(igraph) )
{

  ### convert 'network' -> 'igraph'

  # example network as object of class "network"
  summary(exNetwork)

  # convert to class "igraph"
  g <- asIgraph(exNetwork)

  # check if 'exNetwork' and 'g' are the same
  # (dropping some aux attributes)
  all.equal( structure(as.matrix(exNetwork, "edgelist"), n=NULL, vnames=NULL),
    igraph::as_edgelist(g) )   

  # compare results using 'netcompare'
  netcompare(exNetwork, g)


  ### convert 'igraph' -> 'network'

  # example network as object of class "igraph"
  summary(exIgraph)

  # convert to class "network"
  gg <- asNetwork(exIgraph)

  # check if they are the same
  # (dropping some attributes)
  all.equal( get.edgelist(exIgraph),
            structure(as.matrix(gg, "edgelist"), n=NULL, vnames=NULL))
  netcompare(exIgraph, gg)
}

intergraph documentation built on May 29, 2024, 9:22 a.m.