Various indicators for properties of network
class objects.
has.loops(x)is.bipartite(x, ...)
# S3 method for network
is.bipartite(x, ...)
is.directed(x, ...)
# S3 method for network
is.directed(x, ...)
is.hyper(x)
is.multiplex(x)
TRUE
or FALSE
an object of class network
other arguments passed to/from other methods
Carter T. Butts buttsc@uci.edu
These methods are the standard means of assessing the state of a
network
object; other methods can (and should) use these routines in
governing their own behavior. As such, improper setting of the associated
attributes may result in unpleasantly creative results. (See the
edge.check
argument to add.edges
for an example of code
which makes use of these network properties.)
The functions themselves behave has follows:
has.loops
returns TRUE
iff x
is allowed to contain
loops (or loop-like edges, in the hypergraphic case).
is.bipartite
returns TRUE
iff the x
has been explicitly
bipartite-coded. Values of bipartite=NULL
, and bipartite=FALSE
will evaluate to FALSE
, numeric values of bipartite>=0
will
evaluate to TRUE
. (The value bipartite==0
indicates that it is
a bipartite network with a zero-sized first partition.) Note that
is.bipartite
refers only to the storage properties of x
and
how it should be treated by some algorithms; is.bipartite(x)==FALSE
it does not mean that x
cannot admit a bipartition!
is.directed
returns TRUE
iff the edges of x
are to be
interpreted as directed.
is.hyper
returns TRUE
iff x
is allowed to contain
hypergraphic edges.
is.multiplex
returns TRUE
iff x
is allowed to contain
multiplex edges.
Butts, C. T. (2008). “network: a Package for Managing Relational Data in R.” Journal of Statistical Software, 24(2). https://www.jstatsoft.org/v24/i02/
network
, get.network.attribute
,
set.network.attribute
, add.edges
g<-network.initialize(5) #Initialize the network
is.bipartite(g)
is.directed(g)
is.hyper(g)
is.multiplex(g)
has.loops(g)
Run the code above in your browser using DataLab