Refer to previous edges for cost function

未关闭
#1,158 5 条评论 1 个 reaction 已指派 0 人 在 GitHub 查看

维护者通常 2 天内回复

还没有人认领这个 Issue。

评估

难度
4/5
预计耗时
3-5 天
新手友好度
35/100
Issue 类型
功能
描述清晰度
基本清楚
活跃度
停滞
技术栈
postgresql
领域
api, databases

调研方向

Look at the existing cost function signatures in the pgRouting source, likely in src/ or include/ directories. The user wants to pass the previous edge as a parameter to the cost function. Examine how the graph traversal algorithms (like Dijkstra, A*) are structured to understand where the previous edge context is available. Check the documentation for custom cost functions to see the current interface and what would need to be extended. 'Done' means a design proposal or patch that allows a cost function to access the previous edge.

由索引模型根据 Issue 内容生成。

描述

Functionality Request

I could not find such a thing in the docs:

I want to calculate cost based on the previous edge (for instance, get the path with the least number of turns). Is there a way to do this currently?

Something along these lines:

angle(parentEdge, currentEdge) AS cost

Thanks,

主要语言
C++
星标
1.4k
派生
397
平均合并
2 天 2 小时
30 天内合并 PR
4

环境准备

从这里开始

  1. 先读完整个 Issue,再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库,在一个分支上完成修改。
  4. 提交 Pull Request,并在描述里引用这个 Issue 编号。

pgRouting/pgrouting 的其他 Issue

查看 pgRouting/pgrouting 的全部 Issue

相似的 Issue

更多 C++ Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。