INNER CODE UNIT · JavaScript

flag1

lh3/pangene · pangene.js:317

		let flag1 = [], flag2 = []; // flag1 for end finding; flag2 for get_bubble()
		for (let v = 0; v < n_vtx; ++v)
			flag1[v] = flag2[v] = -1;

		// look for bubbles
		let bb = [];
		for (let vs = 0; vs < n_vtx; ++vs) {
			// test if vs needs to be checked
			const cec = this.seg[vs>>1].cec;
			if (cec < 0 || this.idx[vs].n == 0) continue;
			if (this.idx[vs].n == 1) {
				const w = this.arc[this.idx[vs].o].w ^ 1;
				if (this.idx[w].n < 2) continue;
			}

			// BFS starting from vs
			let queue = [vs], ve = [], ext = 0;
			flag1[vs] = f1;

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…