Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

0-1 graph

GATE CSE & IT · Graph Algorithms · 2003-2003

1
PYQs
100%
keyed
0
elite explanations
1
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2003 PYQ

Let G=(V,E) be an undirected graph with a subgraph G 1 =(V 1 ,E 1 ). Weights are assigned to edges of G as follows. $$$w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, oth...

mediumanswer key
GATE CSE & IT — 0-1 graph PYQ Drill | PYQLabs