在Pregel模型下编程实现s-t最短路径问题

最新推荐文章于 2024-09-20 15:32:13 发布

无敌猫鲜生

最新推荐文章于 2024-09-20 15:32:13 发布

阅读量451

点赞数 10

分类专栏：大数据开源框架文章标签： java 算法

本文链接：https://blog.csdn.net/m0_64986186/article/details/134915993

版权

大数据开源框架专栏收录该内容

8 篇文章 0 订阅

订阅专栏

class ShortestPathVertex
:public Vertex<int, int, int> {
  void Compute(MessageIterator* msgs) {
    int mindist = IsSource(vertex_id()) ? 0 : INF;
    for (; !msgs->Done(); msgs->Next())
      mindist = min(mindist, msgs->Value());
    if (mindist < GetValue()) {
      *MutableValue() = mindist;
      OutEdgeIterator iter = GetOutEdgeIterator();
      for (; !iter.Done(); iter.Next())
        SendMessageTo(iter.Target(),
      mindist + iter.GetValue());
    }
    VoteToHalt();
  }
};

class MinIntCombiner : public Combiner<int> {
  virtual void Combine(MessageIterator* msgs) {
    int mindist = INF;
    for (; !msgs->Done(); msgs->Next())
      mindist = min(mindist, msgs->Value());
    Output("combined_source", mindist);
  }
};