Register
Dark Mode

TestBook TestSeries question to find number of paths in directed graph

in Algorithms retagged by
233 views
0 votes
0 votes

Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1.

Number of paths from A to K are __

in Algorithms retagged by
by
233 views

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!