• Topology Sort
• Articulation Point & Edge

• 정올 - "http://jungol.co.kr/"
• 백준 - "https://www.acmicpc.net/"
• "삼성SDS SW검정 프로 교육" -- "https://koitp.org/"
• "삼성 SDS Professional 대비 문제풀이반" https://koitp.org/category/SDS_PRO_201609/

package problem;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.management.ManagementFactory;
import java.lang.management.MemoryMXBean;
import java.util.StringTokenizer;

public class Solution {

    public static void main(String[] args) throws Exception {
        long START_TIMESTAMP = System.currentTimeMillis();

        System.setIn(Solution.class.getResourceAsStream("sample_input.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        StringBuilder sb = new StringBuilder();
        StringTokenizer st = null;
        int T = Integer.parseInt(br.readLine().trim());
        for (int test_case = 1; test_case <= T; test_case++) {
            int result = 0;

            /*****************
             * Solution Code *
             *****************/



            System.out.println("#" + test_case + " " + result);
//            sb.append("#" + test_case + " " + result + '\n');
        }


        long END_TIMESTAMP = System.currentTimeMillis();
        MemoryMXBean mxBean = ManagementFactory.getMemoryMXBean();
        System.out.println("Spend Time: " + (END_TIMESTAMP - START_TIMESTAMP) + " ms");
        System.out.println("Usage Heap Memory: " + mxBean.getHeapMemoryUsage().getUsed() / 1024  + " KB");

//        System.out.println(sb.toString());
    }
}

G = (V,E)
(G: Graph, V: set of vertices, E: set of edges)

1. Adjacency Matrix
2. Adjacency List
3. Edge List

directed edge (v1, v2) != (v2, v1)
undirected edge (v1, v2) = (v2, v1)

v1, v2 are adjacent
iff there exists an edge e such that e = (v1, v2)

some edge e is incident on v1 and v2
iff e = (v1, v2)

e1, e2 are called parallel
iff e1 = (v1, v2), e2 = (v1, v2)

Loop is an edge incident on a single vertex.
(loop = (v1, v1))

v is isaolated vertex in Graph G(V,E)
iff there are not exists any edges e such that are incident on v.

A graph with neither loop nor parallel edges is called simple.

Weighted Graph is a graph with numbers(weight) on the edges.

The complete graph (V,E) in n vertices is the simple graph with n vertices
satisfying that there exists some edge e in E
(e = (v, w) for any v,w in V)

A path from v0 to vn of length n
(v0, e1, v1, e2, v2, ..., en-1, vn)

Alternating sequence of V, E

A graph G = (V, E) is connected
iff for any two vertex v, w, there exists some path from v to w.

G = (V, E)
G' = (V', E')
V' is subset of V
E' is subset of E
For any edge e in E', e = (v, w), then v, w is in V'

A simple path from v to w is a path with no repeated vertices.

A cycle is a path from v to v with no repeated edge. (possible repeated vertices)

A simple cycle is a cycle from v to v with no repeated vertices except for v.

An Euler cycle is a cycle in a graph that includes all vertices and edges of G.

https://dyngina.tistory.com/16

• Sample Code

• https://dyngina.tistory.com/14
• Sample Code

• https://www.acmicpc.net/blog/view/9
• Sample Code
• SegmentSumTree
• SegmentMaxTree
• Lazy Propagation
• Lazy Propagation2

• https://www.acmicpc.net/blog/view/21
• Sample Code

1. single source & single destination (distance)
2. single source (distance[i] : c0 --> i) --> dijkstra algorithm, bellman ford
3. single destination (distance[i] : i --> c0)
4. all pairs (distnace[i][j] : i--> j) --> floyd-warshall

• https://ko.wikipedia.org/wiki/%EB%8D%B0%EC%9D%B4%ED%81%AC%EC%8A%A4%ED%8A%B8%EB%9D%BC_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98
• Sample Code

• https://ko.wikipedia.org/wiki/%EB%B2%A8%EB%A8%BC-%ED%8F%AC%EB%93%9C_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98
• Sample Code

• https://ko.wikipedia.org/wiki/%ED%94%8C%EB%A1%9C%EC%9D%B4%EB%93%9C-%EC%9B%8C%EC%85%9C_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98
• Sample Code

• https://ko.wikipedia.org/wiki/%EC%84%9C%EB%A1%9C%EC%86%8C_%EC%A7%91%ED%95%A9_%EC%9E%90%EB%A3%8C_%EA%B5%AC%EC%A1%B0
• Sample Code

1. DFS로 구현 (DFS Spanning Tree)
2. Queue with indgree 로 구현

• https://m.blog.naver.com/PostView.nhn?blogId=xowns4817&logNo=221080426768&proxyReferer=https:%2F%2Fwww.google.com%2F
• https://jason9319.tistory.com/93
• Sample Code

1. Kruskal Algorithm
2. Prim's Algorithm

• https://bowbowbow.tistory.com/3
• ArticulationPoint.java
• ArticulationEdge.java

https://www.acmicpc.net/problem/2170

• Sample Code

$ vi ~/.gitconfig
[user]
  name = rolroralra
  email = shyoung.kim@samsung.com
[http]
  proxy = http://70.10.15.10:8080
  sslVerify = false
[https]
  proxy = http://70.10.15.10:8080
[credential]
  helper = wincred
[filter "lfs"]
  clean = git-lfs clean -- %f
  smudge = git-lfs smudge -- %f
  process = git-lfs filter-process
  required = true
[core]
  autocrlf = true