Skip to main content
1 vote

BFS on directed graph with disjointed edges?

Assuming you want the following: Given a graph $G=(V,E)$ and a set of nodes $N \subseteq V$, find a tree $T$ that spans over all nodes in $N$. Here, $T$ is a spanning tree of the induced subgraph of a ...
codeR's user avatar
  • 1,293

Only top scored, non community-wiki answers of a minimum length are eligible