Introduce shortest path algorithms(Korean)Wonjae Kim
Introduce shortest path algorithms(Korean) in Hongik University.
1. Bellman-Ford
2. Dijkstra
3. Floyd-Warshall
Extra) A*
In this slide, Source of graph images is stackexchange
1. http://cs.stackexchange.com/questions/18138/dijkstra-algorithm-vs-breadth-first-search-for-shortest-path-in-graph
2. http://cs.stackexchange.com/questions/14248/what-is-the-significance-of-negative-weight-edges-in-a-graph
If it is a problem or can be, Let me know it ( wonjaek36@gmail.com )
Hey guys, My name is EunSun Park and this is my portfolio. Now I'm taking part in a competition and I want to explain what I want to be and what my vision is
Introduce shortest path algorithms(Korean)Wonjae Kim
Introduce shortest path algorithms(Korean) in Hongik University.
1. Bellman-Ford
2. Dijkstra
3. Floyd-Warshall
Extra) A*
In this slide, Source of graph images is stackexchange
1. http://cs.stackexchange.com/questions/18138/dijkstra-algorithm-vs-breadth-first-search-for-shortest-path-in-graph
2. http://cs.stackexchange.com/questions/14248/what-is-the-significance-of-negative-weight-edges-in-a-graph
If it is a problem or can be, Let me know it ( wonjaek36@gmail.com )
Hey guys, My name is EunSun Park and this is my portfolio. Now I'm taking part in a competition and I want to explain what I want to be and what my vision is
4. 04
ENDLESS CHALLENGE & PASSION
끝없는 도전과 열정으로
DESIGNER
디자인 전공, 모든 분야를 디자인하는 디자이너가 될 것이다
TWINKLE
다이아몬드를 꿈꾸는 나는, 빛나는 원석이다
I’M READY
나는 부딪히고 깨질 준비가 되어 있다
SOCIAL MANAGER
나는 소통 가능한 소셜 매니저다
DO MY BEST
나는 보석이 되기 위해 최선을 다할 것이다