INNER CODE UNIT · JavaScript

e

lh3/pangene · pangene.js:692

				const e = new BackEdgeNode(off + i);
				blist.push(e);
				vs[w].be_end.push(e);
			}
			if (hi2 < hi0 && hi2 < t) { // then create a capping back edge; this line is different from Johnson et al
				const w = v_dis[hi2];
				const d = new BackEdgeNode(-1); // capping back edge
				blist.push(d);
				vs[w].be_end_cap.push(d);
			}
			vs[v].blist = blist;
			if (0) this.#dbg_blist(blist);

			// determine the category for tree edge (parent(v),v)
			if (this.dfs_par[v] >= 0) { // not a root (there may be multiple roots if the graph is disconnected)
				const u = this.dfs_par[v]; // v's parent
				const n = this.idx[u].n, off = this.idx[u].o;
				let e = -1; // the tree edge from u to v

View source record →