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
Post a Comment