Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs