In a simple vehicle routing problem solved by Google OR-tools library, two nodes (2, 3) are marked as optional with visiting penalty set to 0. The shortest path
partial-specialization
dialogflow-cx
facebook-access-token
selectedindexchanged
chartjs-plugin-annotation
busy-cursor
shapely
wildfly-10
one-time-pad
react-vis
crawlera
reconnect
opendata
drop-database
linkshare
database-caching
tensorflow-data-validation
makecode
cl.exe
directoryentry
herestring
gaps-in-data
puma-dev
vue-cookies
android-graphview
haxeflixel
rfc6902
facet-grid
baidu
webdeploy-3.5
