Consider a shortest-path finding problem, such that the shortest path from green to red must be found. For this, I would like to use the Hill Climbing approach
powershell-remoting
msp432
addressbook
subgit
wallaby
app-shell
mlmd
trompeloeil
metaplex
handoff
binding-mode
ipod-touch
stdmutex
graph-visualization
dtls
bus
hbase
synchronous
leksah
graphical-programming
nscopying
mediastreamsource
android-cardview
packetbeat
docusignapextoolkit
trax
buttonclick
text-direction
multilabel-classification
orderbook