๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

Adjacency List1

[Java] Graph (Adjacency Matrix, Adjacency List) ์ •์ (Vertex)๊ณผ ๊ฐ„์„ (Edge)๋กœ ๊ตฌ์„ฑ๋œ ๊ฒƒ, Graph(G) = (Vertex(V), Edge(E)) Graph ์šฉ์–ด ์ •์ (Vertex) - ๋…ธ๋“œ, ํŠน์ •ํ•  ์ˆ˜ ์žˆ๋Š” ์‹ค์ฒด๊ฐ„์„ (Edge) - ์ •์  ๊ฐ„ ์ด์–ด์ ธ ์žˆ๋Š” ์„ ๊ฐ€์ค‘์น˜(Weight) - ์ •์  ๊ฐ„์— ๊ฑฐ๋ฆฌ, ๋น„์šฉ (๊ฐ„์„ ์˜ ๊ธธ์ด๋ผ๊ณ  ์ƒ๊ฐํ•ด๋„ ์ข‹์Œ)๊ฒฝ๋กœ(Path) - ์ถœ๋ฐœ ์ •์ ์—์„œ ๋„์ฐฉ ์ •์ ๊นŒ์ง€์˜ ๊ฑฐ์ณ ๊ฐ„ ์ˆœ์„œ์ˆœํ™˜(Cycle) - ๊ฒฝ๋กœ์˜ ์ถœ๋ฐœ ์ •์ ๊ณผ ๋„์ฐฉ ์ •์ ์ด ๊ฐ™์€ ๊ฒฝ์šฐ์ฐจ์ˆ˜(Degree) - ์ •์ ์— ๋ถ™์€ ๊ฐ„์„  ์ˆ˜์ง„์ž… ์ฐจ์ˆ˜(In-Degree) - ์ •์ ์œผ๋กœ ๋“ค์–ด์˜ค๋Š” ๊ฐ„์„  ์ˆ˜์ง„์ถœ ์ฐจ์ˆ˜(Out-Degree) - ์ •์ ์—์„œ ๋‚˜๊ฐ€๋Š” ๊ฐ„์„  ์ˆ˜Graph ์ข…๋ฅ˜ ์œ ํ–ฅ ๊ทธ๋ž˜ํ”„(Directed Graph) - ํŠน์ • ์ •์ ์—์„œ ํŠน์ • ์ •์ ์œผ๋กœ ์ด๋™ํ•˜๋Š” ๊ทธ๋ž˜ํ”„๋ฌดํ–ฅ ๊ทธ๋ž˜ํ”„(UnDire.. 2024. 7. 9.