Timeline for Given a digraph and a root, find a tree that minimizes the sum of edges

16 events

when toggle format	what		by	license	comment
Dec 5, 2016 at 20:59	history	edited	CSnewbieHking	CC BY-SA 3.0	Updating the question
Dec 5, 2016 at 18:43	vote	accept	CSnewbieHking
Dec 6, 2016 at 2:14
Dec 5, 2016 at 18:43	history	edited	CSnewbieHking	CC BY-SA 3.0	deleted 6963 characters in body
Dec 5, 2016 at 18:38	vote	accept	CSnewbieHking
Dec 5, 2016 at 18:43
Dec 5, 2016 at 4:01	history	edited	CSnewbieHking	CC BY-SA 3.0	deleted 1 character in body
Dec 5, 2016 at 3:54	history	edited	CSnewbieHking	CC BY-SA 3.0	Update my code
Dec 4, 2016 at 20:46	history	edited	CSnewbieHking	CC BY-SA 3.0	Syntax
Dec 4, 2016 at 20:29	history	edited	CSnewbieHking	CC BY-SA 3.0	Code for AMPL based on answer
Dec 4, 2016 at 17:00	vote	accept	CSnewbieHking
Dec 4, 2016 at 22:40
Dec 4, 2016 at 16:57	history	edited	D.W.♦		edited tags
Dec 4, 2016 at 16:43	history	edited	D.W.♦	CC BY-SA 3.0	added 83 characters in body
Dec 4, 2016 at 12:56	history	edited	David Richerby	CC BY-SA 3.0	Formatting
Dec 4, 2016 at 12:39	comment	added	j_random_hacker		Hint: Google "minimum spanning tree in directed graph", you'll come to the Chiu-Liu/Edmonds algorithm. Now think about how you could reduce the weight further by getting rid of some vertices; is it safe to do so greedily?
Dec 4, 2016 at 10:52	history	edited	Raphael		edited tags
Dec 4, 2016 at 5:45	review	First posts
Dec 4, 2016 at 12:56
Dec 4, 2016 at 5:44	history	asked	CSnewbieHking	CC BY-SA 3.0