Skip to content

Instantly share code, notes, and snippets.

@lafarer
lafarer / README.md
Last active October 5, 2022 16:23
Run ubuntu VM with multipass on Mac

Install multipass

> brew install multipass

Install Microsoft Remote Desktop

@lafarer
lafarer / linting-commit-message.sh
Last active April 13, 2023 16:03
Conventional commits - Linting commit message
#!/usr/bin/env bash
# https://conventionalcommits.org
# https://www.freecodecamp.org/news/how-to-use-commitlint-to-write-good-commit-messages/
# Initialize git repository
git init
# Initialize node project
yarn init -y
# Initialize commitlint

Dijkstra

A graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.

Click to select source and destination.