shutdown -r
- Resources
- Workflow
- CRUD
Dijkstra's
algorithm solves the single-source shortest path problem.Bellman–Ford
algorithm solves the single-source problem if edge weights may be negative.A*
search algorithm solves for single pair shortest path using heuristics to try to speed up the search.Floyd–Warshall
algorithm solves all pairs shortest paths.
http://www.htmlgoodies.com/beyond/reference/8-responsive-design-mistakes-to-avoid.html
Recommend : 44x44 Smallest : 28x28
Run scala in sbt
sbt console
tags: app
- oh-my-zsh