Baekjoon 7576
in Study / Computer science on Baekjoon 7576
BFS
Jump to: Navigation
Dijkstra Algorithm
in Study / Computer science on Dijkstra algorithm
Algorithm
- 다익스트라 or 데이크스트라 algorithm
- In suggested graph, we can use it for calculating the shortest distance from the same start node to other nodes
- BFS vs Dijkstra
- BFS : mainly used for calculating the shortest distance in the graph which has no weight
- Dijkstra : mainly used for calculating the shortest distance in the graph which has specific weight on every edges
Mortal Fibonacci Rabbits
in Study / Rosalind on Rosalind problem
A problem from rosalind “Bioinformatics Stronghold” category, Dynamic Programming
- A problem from rosalind “Bioinformatics Stronghold” category
Rosalind Problem Link
Sieve of Eratosthenes
in Study / Computer science on Sieve of eratosthenes
Algorithm
- 에라토스테네스의 체
- Given 1, 2, 3, …, N, it can be used for calculating the number of prime numbers
Remainder
in Study / Computer science on Remainder
Algorithm
- 나머지
- If A % B = C & D % B = C → A ≡ D (mod B)