Register

Virtual Gate Test Series: Algorithms - Directed Graph

• edited by
1,154 views
2 2 votes

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Memory ManagementNext → · Virtual Gate Test Se...
← Previous in category · Randomised quicksortNext in category → · Virtual Gate Test Se...
Position:
Show:

Related questions

3 3 votes
1 1 answer
351
351 views
GO Classes asked Aug 31
351 views
GO Classes DPP | GATE CS, DA | Algorithms | Directed Graph
Let $G$ be a directed graph with nonnegative edge weights, and let $s$ and $t$ be vertices of $G$.Consider the statement:Any shortest path from $s$ to $t$ in $G$ is also ...
1 1 vote
2 2 answers
2.3k
2.3k views
firki lama asked Dec 29, 2016
2,339 views
Virtual Gate Test Series: Algorithms - Matrix Chain Ordering
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below$A_{1}\rightarrow 2\times 3$$A_{2}\rightarrow 3\times 5$$A_{3}\rightarrow 5\times...
3 3 votes
1 answers 1 answer
2.1k
2.1k views
Shubhanshu asked Oct 12, 2017
2,147 views
Rossen: How to perform Composition on Directed Graph.
Given the directed graphs representing two relations, how can the directed graph of the union, intersection, symmetric difference, difference, and composition of these re...
2 2 votes
0 0 answers
962
962 views
charul asked Aug 17, 2017
962 views
Directed graph
how to calculate number of directed graphs possible having n vertices?