๋ชฉ๋กgraph (1)

YS's develop story

Graph (๊ทธ๋ž˜ํ”„) ์ •๋ฆฌ

๐Ÿ‘จ๐Ÿผ‍๐Ÿ’ป Graph (๊ทธ๋ž˜ํ”„) ์ •๋ฆฌ With Python ๐Ÿฅ Graph ๋ž€? ์‹ค์ œ ์„ธ๊ณ„์˜ ํ˜„์ƒ์ด๋‚˜ ์‚ฌ๋ฌผ์„ Vertex(์ •์ )์™€ Edge(๊ฐ„์„ )๋กœ ํ‘œํ˜„ํ•˜๊ธฐ ์œ„ํ•ด ์‚ฌ์šฉํ•ฉ๋‹ˆ๋‹ค. Vertex : ์œ„์น˜๋ฅผ ๋งํ•ฉ๋‹ˆ๋‹ค. Node๋ผ๊ณ  ํ•˜๊ธฐ๋„ ํ•ฉ๋‹ˆ๋‹ค. Edge : ์œ„์น˜ ๊ฐ„์˜ ๊ด€๊ณ„๋ฅผ ํ‘œ์‹œํ•œ ์„ ์ž…๋‹ˆ๋‹ค. Degree : ๋ฐฉํ–ฅ์ด ์—†๋Š” ๊ทธ๋ž˜ํ”„์—์„œ ํ•˜๋‚˜์˜ ์ •์ ์— ์ธ์ ‘ํ•œ ์ •์ ์˜ ์ˆ˜์ž…๋‹ˆ๋‹ค. Simple Path : ์ฒ˜์Œ ์ •์ ๊ณผ ๋ ์ •์ ์„ ์ œ์™ธํ•˜๊ณ  ์ค‘๋ณต๋œ ์ •์ ์ด ์—†๋Š” ๊ฒฝ๋กœ์ž…๋‹ˆ๋‹ค. (A-B-C๋Š” Simple Path) Cycle : Simple Path์˜ ์‹œ์ž‘ ์ •์ ๊ณผ ์ข…๋ฃŒ ์ •์ ์ด ๋™์ผํ•œ ๊ฒฝ์šฐ์ž…๋‹ˆ๋‹ค. ๐Ÿ‹ ๊ทธ๋ž˜ํ”„์˜ ์ข…๋ฅ˜ Undirected Graph ๋ฐฉํ–ฅ์ด ์—†๋Š” ๊ทธ๋ž˜ํ”„์ž…๋‹ˆ๋‹ค. Edge๋ฅผ ํ†ตํ•ด Vertex ์–‘ ๋ฐฉํ–ฅ์œผ๋กœ ๊ฐˆ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. Dire..

Data Structure 2021. 7. 29. 09:19