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

A

Antonzm2016-03-13 14:29:01

Looking for a path vector in a graph, is there a graph-wide traversal (using a stack)? 1Reply

A

alexeysikora2021-11-15 17:39:50

How to build a graph from a matrix? 1Reply

B

bober2282022-04-13 17:50:58

How to simulate breaking graph vertices? 1Reply

A

Artem Mayorov2019-02-24 18:14:14

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

N

nightblaze2016-10-03 09:31:31

How to store and display graphs? 2Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question