Lines Matching refs:chains

286 $G$ are partitioned into chains $Z_1, ..., Z_k$, where each chain
289 collection of intersections with the chains, i.e., $S =
317 topological number and then decompose the graph into chains. Once
325   @<Decompose the condensation graph into chains@>
350 order and we will be adding vertices to the chains from the out-edge
384 Now we are ready to decompose the condensation graph into chains.  The
387 These lists will be stored in the \code{chains} vector below.  To
388 create the chains we consider each vertex in the graph in topological
393 @d Decompose the condensation graph into chains
395 std::vector< std::vector<cg_vertex> > chains;
402       chains.resize(chains.size() + 1);
403       std::vector<cg_vertex>& chain = chains.back();
441 for (size_type i = 0; i < chains.size(); ++i)
442   for (size_type j = 0; j < chains[i].size(); ++j) {
443     cg_vertex v = chains[i][j];
453 of intersections with the chains. Each successor set is represented by
464   std::vector<cg_vertex>(chains.size(), inf));
494   for (size_type j = 0; j < chains.size(); ++j) {
498       for (size_type k = pos_in_chain[v]; k < chains[j].size(); ++k)
499         CG[i].push_back(chains[j][k]);