Each of the above functions takes a network and a matrix as input, and returns a network object whose edgeset reflects the given information. network.adjacency takes x to be an adjacency matrix; code.edgelist takes x to be an edgelist matrix; and network.incidence takes x to be an incidence matrix. network.bipartite takes x to be an adjacency matrix where the rows are thge actors and the columns are the events; If ignore.eval==FALSE, (non-zero) edge values are stored as edgewise attributes with name names.eval. Any additional command line parameters are passed to add.edge.
References
Butts, C.T. 2002. ``Memory Structures for Relational Data in R: Classes and Interfaces'' Working Paper.
#Create an arbitrary adjacency matrixm<-matrix(rbinom(25,1,0.5),5,5)
diag(m)<-0g<-network.initialize(5) #Initialize the networkg<-network.adjacency(m,g) #Import the edge data