Register

Recent questions tagged graph-algorithms

0 votes
1 answer
31
Algorithms
Focus on the word constraint , I am little confused (in meaning of the word)here. What should be the answer 2 or 16.
Focus on the word constraint , I am little confused (in meaning of the word)here. What should be the answer 2 or 16.
User Avatar
0 votes
2 answers
36
NPTEL Assignment Question
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}. What is the value of deg(v1)+ deg(v2) + · · · + deg(v30)? 300 600 900 None of these
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}.What is the value of deg(v1)+ de...
User Avatar
8 votes
3 answers
42
GATE CSE 2021 Set 1 | Question: 17
Consider the following undirected graph with edge weights as shown: The number of minimum-weight spanning trees of the graph is ___________.
Consider the following undirected graph with edge weights as shown:The number of minimum-weight spanning trees of the graph is ___________.
User Avatar
0 votes
2 answers
44
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm
Which of the following algorithm solve the all-pair shortest path problem?Dijakstra’s algorithmFloyd’s algorithmPrim’s algorithmWarshall’s algorithm
User Avatar
0 votes
2 answers
46
NIELIT 2017 July Scientist B (CS) - Section B: 42
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjacency matrix? $O(n)$ $O(m+n)$ $O(n^2)$ $O(mn)$
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjace...
User Avatar
8 votes
4 answers
49
GATE CSE 2020 | Question: 49
Consider a graph $G = (V,E)$, where $V = \{v_1,v_2, \dots ,v_{100}\}$, $E = \{(v_i,v_j) \mid 1\leq i < j \leq 100\}$, and weight of the edge $(v_i,v_j)$ is $\mid i – j \mid$. The weight of minimum spanning tree of $G$ is _________
Consider a graph $G = (V,E)$, where $V = \{v_1,v_2, \dots ,v_{100}\}$, $E = \{(v_i,v_j) \mid 1\leq i < j \leq 100\}$, and weight of the edge $(v_i,v_j)$ is $\mid i – j ...
User Avatar
Page: