Hi, I would not call this a mixed graph. In a mixed graph you can have directed and undirected edges, and an undirected edge is not equivalent to a pair of mutual directed edges.
As for your question about trouble, for any measure you calculate, you need to think about whether it makes sense for your graph. If you have specific questions, let us know. Gabor On Sun, Mar 23, 2014 at 8:17 PM, Emanuel Lopez <[email protected]>wrote: > Hi everyone, and thank you in advance for your help. > > I'm working with a social network where the links represent different > kinds of "knowledge transfers". Whithin these, there are flows that we > consider as undirected by definition, or actually mutually directed between > two nodes, such us "joint R&D"; and there are other ties where knowledge > flows goes only in one direction, "training" for example. > > So we have a kind of "mixed graph" that in principle can not be handled by > igraph, > but I am looking for the best way to emulate this mixed network with the > package. > > The first idea that comes to my mind is to represent undirected links as > composed by two ties between the two nodes involved, so for example an > undirected link between A and B would be represented by A->B & B->A. In the > case of directed links, we just record the one tie that exist. > > Can you see any trouble with this approach? Are there better ways to > emulate mixed graphs with igraph? > > Thanks for your help! > > *Emanuel López* > CENIT > Callao 353, 3er piso B > 1022 Buenos Aires - Argentina > (5411) 4373-3714 / 5199-6393 > www.fund-cenit.org.ar > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
