GATE CSE · 2022 · CS
Question 58: Algorithms
Give it a try, then reveal the answer to check your work.
Question 58
CSNAT2 marksNeeds review
Let
be a directed graph, where
is the set of vertices and
is the set of directed edges, as defined by the following adjacency matrix
.
indicates a directed edge from node
to node
. A directed spanning tree of
, rooted at
, is defined as a subgraph
of
such that the undirected version of
is a tree, and
contains a directed path from
to every other vertex in
. The number of such directed spanning trees rooted at vertex 5 is __________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2022CS
GATE CSE 2022 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- Question type
- Numerical answer (NAT)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
algorithms
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.