Created: 2023-05-05 18:06
Status: #idea
Subject: Discrete Mathematics Programming
Tags: Graph Theory Graph Directed Graph
Greedy Algorithm
Greedy is an Algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.
It does not always give the shorted path in a Pathfinding problem, instead use Djikstra's Algorithm.