How to make from graph->tree?

S

S

SarpedonS2015-04-25 20:26:49

Counts

SarpedonS, 2015-04-25 20:26:49

How to make from graph->tree?

Condition:
It is known that the given graph is not a tree. Check if it is possible to remove one vertex from it (together with the edges incident to it) so that the result is a tree.
How to write this function in c++?

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)

M

mamkaololosha, 2015-04-25
@mamkaololosha

en.wikipedia.org/wiki/Minimum_spanning_tree

Similar questions

Z

zemlyakov2018-10-03 14:03:20

What is the size of the dominating set of the directed graph (tournament)? 1Reply

A

Artem Mayorov2019-02-24 18:14:14

Where can I download examples of large weighted graphs? 0Reply

A

Andrey PINEAPPLE2016-10-12 01:40:59

What program do you use to draw a graph? 5Reply

H

hana012020-12-03 21:16:17

How to visualize graphs in Java? 1Reply

F

Fedor unknown2019-04-28 21:21:08

Undirected graph with four vertices possible? 2Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question