algorithm - How to identify cycles in a huge directed graph? -


there huge n edges on directed graph.

i have fix memory, such 128mb. graph size gb or more.

you can't put them memory, can cache disk, how can more access file?

if load part memory, has cycle in rest without memory.

how solve ?

remember huge n fixed memory.


Comments

Popular posts from this blog

c++ - Difference between pre and post decrement in recursive function argument -

php - Nothing but 'run(); ' when browsing to my local project, how do I fix this? -

php - How can I echo out this array? -