关于pgr_dijkstra求1对多最短路径问题

Question

问题是这样的，求出距离A点 1km 到1.5km的所有点。

pgr_dijkstra中一对多使用数组来表示‘多’的那一组点，但现在的问题是，我这里有1900多个点，如何用数组表示从1到1900的点？

Answer 1

补充 原题：
Find nodes that are more than 1 mile and less than 1.5 miles from node 459, when walking. List the nodes and their distance in miles from node 459 and order results ascending by the distance.

pgr_dijkstra one to many:

 pgr_dijkstra(TEXT edges_sql, BIGINT start_vid, ARRAY[ANY_INTEGER] end_vids,
    BOOLEAN directed:=true);
RETURNS SET OF (seq, path_seq, end_vid, node, edge, cost, agg_cost) or EMPTY SET