Find out the topological ordering of the given graph

sampad asked Jan 17, 2016

388 views

1 votes

sampad asked Jan 17, 2016

sampad

388 views

See all

2 2 Comments

monanshi

commented Jan 17, 2016

I am getting A?

0 votes

sampad

commented Jan 17, 2016

explain.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 votes

Ans is A

Follow this link https://www.youtube.com/watch?v=ddTC4Zovtbc

. answered Jan 18, 2016

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

3 votes

1 answer

stanchion asked Oct 21, 2017

968 views

topological ordering of DAG
What is the method to find no of topological ordering of a Directed Acyclic Graph? For an instance, i found two graphs on internet, whose no of topological ordering is given but how to quickly calculate the total no of ordering? Graph 1 For graph 1, no of ... . If I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?

What is the method to find no of topological ordering of a Directed Acyclic Graph?For an instance, i found two graphs on internet, whose no of topological ordering is giv...

stanchion

968 views

stanchion asked Oct 21, 2017

DS
topological-sort
data-structures
directed-acyclic-graph
no-of-topological-ordering

+ –

2 votes

0 answers

h4kr asked Jan 10, 2023

348 views

What are the total number of topological ordering?

h4kr

348 views

h4kr asked Jan 10, 2023

Algorithms
topological-sort
algorithms

+ –

0 votes

1 answer

sonalrawat asked Aug 21, 2023

687 views

We are given a directed graph, represented as an adjacency list, in which each vertex has at least one incoming edge and one outgoing edge. We would like to print out for each vertex j the list of vertices pointing into j. What is the most accurate description of the complexity of computing these quantities in terms of n, the number of vertices, and m, the number of edges? O(n2) O(nm) O(m) O(n)

sonalrawat

687 views

sonalrawat asked Aug 21, 2023

Algorithms
algorithms
time-complexity

+ –

3 votes

3 answers

sampad asked Oct 20, 2015

3,723 views

Find out the recurrence relation for the given problem
If $a_n$ is number of ternary sequences of length $n$ with even number of $0$'s, then the recurrence relation for $a_n$ is? Also find the value of $a_8$.

If $a_n$ is number of ternary sequences of length $n$ with even number of $0$'s, then the recurrence relation for $a_n$ is?Also find the value of $a_8$.

sampad

3.7k views

sampad asked Oct 20, 2015

Combinatory
engineering-mathematics
combinatory

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

2 2 Comments

0