GeeksforGeeks

Is there a way to find the second minimum spanning tree in less than O(V^2)? If yes can you supply the theorem or algorithm

We all know how to find the minimum spanning tree of a connected weighted undirected graph. Can you give an algorithm to find the second , third... minimum spanning trees by weight?

Wikipedia says that “In graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two vertices of H are adjacent if and only if they are not adjacent in G. That is to find the complement of a graph, you fill in all the missing edges to get a complete graph, and remove all the edges that were already there. It is not the set complement of the graph; only the edges are complemented.” For example, each of the following two graphs is complement of the ot...

in directed graph there are 7 verteces and 25 edgs.the out going of 6 verteces are given what is outgoing of last vertex
v1 3
v2 2
v3 6
v4 1
v5 4
v6 5
v7 ?

I need to write a program where the user has to guess the random number that the program makes up. The range is between 0 - 100 and the user only gets 10 tries to guess the number. If the number is too high or too low, it informs the user by saying that the random number is lower or higher.

I'm still learning Java and C++ is very new to me, even though most of the stuff is similar. The program that I have written compiles and runs, but it doesn't seem to reach the steps that tell the u...

Hi,
i looked at the source code and understand it very well located on

http://geeksforgeeks.org/?p=2686

how can i insert the new nodes in the tree with such tree logic?

A

when A refers B, then B will go on A's level 1 since it's empty like this:

A
B

Now if A refers C, then the matrix will look like this:
A
B C

Now if A refers D, then D will go under B like this:

...

What are the differences Bellman Ford and Dijkstra Algos for single source shortest paths?

O(n^2) algorithm to find out if a graph is bipartite?

What r the differencces between following representations of Graph

1) Adjacency List Representation
2) Adjacency Matrix Representation

Are there any problems or standard algos which work for one representation and not for other?

if the Road-Tool Tax Matrix between different cities are :-

[b]S [/b] 1 8 16 4
3 7 6 3 12
9 4 11 5 9
2 5 13 3 7
12 11 3 6 [b]D[/b]

Please note that we can travel only [i]right [/i]and [i]downwards [/i]from Source [b]S[/b]....

Which of the following two is a better Graph traversal algorithm for path finding between two nodes X and Y in a given Graph
1) BFS
2) DFS

How to find all possible cycles in a graph?

Write a Complete program check whether Graph is Connected or Not & also for whether Graph is Tree or not.

Prove that in a graph, sum of degrees = twice the number of edges.

given that, also deduce a relation between number of vertices and number of edges.

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?
(A) No two vertices have the same degree.
(B) At least two vertices have the same degree.
(C) At least three vertices have the same degree.
(D) All vertices have the same degree.

Why does the following link use 3 colors for BFS of graph. Same algo is given in Cormen book also.
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm

The program could be implemented only with 2 (marked or not). In fact the algo given on Wiki page (http://en.wikipedia.org/wiki/Breadth-first_search#Pseudocode) uses only on 1 bit.

How many 32K x 1 RAM chips are needed to provide a memory capacity of 256Kbytes?
(A) 8
(B) 32
(C) 64
(D) 128