Re: [igraph] designing efficient graph algorithms

[Ahmed Abdeen Hamed]

Thank you, I am gonna try this advice but perhaps I will reach out some more.

Thanks very much,

-Ahmed

On Mon, Feb 24, 2014 at 8:54 AM, Gábor Csárdi <address@hidden> wrote:

Hi!

The data structure in igraph is not too bad, although slightly complicated. I think a sorted adjacency list is appropriate for most tasks.

Gabor

On Sun, Feb 23, 2014 at 10:32 PM, Ahmed Abdeen Hamed <address@hidden> wrote:

Hello friends,

What data structures would you use to design an efficient pattern mining algorithm if you have the graph in a CSV file. Loading the graph in memory and iterating over the vertices might be convenient but necessarily most efficient. I would appreciate some help from the original developers who develop algorithms for igraph and make it accessible using the API's.

Thanks very much!

-Ahmed

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help