How to find the diameter of a graph, which have only one cycle(N vertexes, N paths)? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
32:09:26
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

How to find the diameter of a graph, which have only one cycle(N vertexes, N paths)?

Revision en1, by legendjohn9999, 2018-02-06 15:01:59

Hi All. Is there any LINEAR algorithm to find the diameter of a graph, which have only one cycle(N vertexes, N paths)?

Tags

#graph, #diameter

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en1		legendjohn9999	2018-02-06 15:01:59	208	Initial revision (published)