Baekjoon 1520
in Study / Computer science on Baekjoon 1520
DP, DFS
Jump to: Navigation
Baekjoon 2011
in Study / Computer science on Baekjoon 2011
DP
Basic Compiler
in Study / Computer science on Basic compiler
compiler
Computer Science:An Overview, Introduction to CS Course in Yonsei (reference)
This posting is my note that I study the contents and write them by my style
This is the private repository where I can only review my notes
repository
Baekjoon 1010
in Study / Computer science on Baekjoon 1010
DP
DFS
in Study / Computer science on Dfs
Algorithm
- Depth First Search for graph
- Backtracking (move easily back to previous node)
- != BFS
- can be used when we should memorize the previous nodes’ weight value (가중치) in the same path (BFS is used when all nodes have same value for solving minimum distance)
- can be used when we should search all nodes
- Consequently, we can check whether there are nodes that are not connected from the graph
- Size of graph ↑ → inefficient
- We can use DP for removing the repeating search in DFS
- can be used for topology sorting
- can be used for big graph