Re: [igraph] partially directed graph

[Gábor Csárdi]

Hi,

what would be a use case where your graph is not equal to a directed
graph, where some edges are mutual (=your current undirected edges)?

In other words, which functions gives you "wrong" results, if you just
treat you undirected edges as a mutual directed pair?

Gabor

On Tue, Jun 24, 2014 at 2:53 PM, Da Zhou <address@hidden> wrote:
> Hello.
>
> I'm recently doing a project which deals with partially directed graphs
> (that's graphs with both directed and undirected edges).
> I know that I can assign a keyword to each edge so that I can keep track of
> the directedness and direction if it's directed.
> However, in that case, I'll have to write many functions and methods myself.
> So I would like to know if there's a native support for partially directed
> graphs or if I can do some trick so that I don't have to
> write many functions myself.
>
> Thanks in advance.
>
> Da
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>