f**n
发帖数: 401 | 1 【 以下文字转载自 Programming 讨论区 】
发信人: fern (宝宝会翻身了), 信区: Programming
标 题: data structure for set of path in a graph
发信站: BBS 未名空间站 (Tue Mar 23 17:33:56 2010, 美东)
Suppose we have a one-directional graph. Define a path as a sequence of
vertices such that from each of its vertices there is an edge to the next
vertex in the sequence. So a path of three vertices would be recorded
somehow as v1->v2->v3.
Now I need to store a set of paths that are different from each other. For
example, path 1 is v1->v2->v |
|
