기본 용어 (Terminology)
1. Walk Sequence of vertices and edges of a graph. Vertex can be repeated. Edges can be repeated. Open Walk : starting vertex != ending vertex Closed Walk : starting vertex == ending vertex 2. Trail Open walk in which no edge is repeated. Vertex can be repeated. Edges cannot be repeated. 3. Circuit Closed walk in which no edge is repeated. Closed trail. Vertex can be repeated. Edges cannot be re..
그래프 이론 정리
2021. 2. 13. 18:07
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- Union Find
- Sqrt Decomposition
- stack
- Divide & Conquer
- Sparse Table
- Line sweeping
- HLD
- tree
- APIO
- offline
- Centroid Decomposition
- Lazy Propagation
- Interactive
- Persistent Segment Tree
- CHT
- Parametric Search
- Merge Sort
- ioi
- Shortest path
- Segment Tree
- BOJ
- Fenwick Tree
- Floyd-Warshall
- DP
- graph
- DFS
- Codeforces
- convex hull
- ⭐
- Greedy
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
글 보관함