"to travel from San Francisco to Sicily is kinda NP complete" Surely 'shortest path in a multigraph' can't be that much harder than 'shortest path in a graph',

"to travel from San Francisco to Sicily is kinda NP complete" Surely 'shortest path in a multigraph' can't be that much harder than 'shortest path in a graph', right?