Search for a route from node startID and ends at targetID. This will return a linkedlist of the nodes that make up the route from start to end order. If either the start or target node does not exist or if a route can't be found the returned list is empty. @param startID id of the start n
(int startID, int targetID)
source not stored for this graph (policy: none)