The labelled shortest path between two nodes without the labels should be the shortest path

[mgttlinger]

If you drop the labels from a shortest labelled path you do get different paths between nodes. E.g. if you ask for the shortest path from a node n to itself and n does not have an reflexive edge esp produces a path Some(Vector(n)) while lesp produces None.