Coverage Report - org.apache.giraph.benchmark.ShortestPathsComputation
 
Classes in this File Line Coverage Branch Coverage Complexity
ShortestPathsComputation
0%
0/17
0%
0/12
3.5
 
 1  
 /*
 2  
  * Licensed to the Apache Software Foundation (ASF) under one
 3  
  * or more contributor license agreements.  See the NOTICE file
 4  
  * distributed with this work for additional information
 5  
  * regarding copyright ownership.  The ASF licenses this file
 6  
  * to you under the Apache License, Version 2.0 (the
 7  
  * "License"); you may not use this file except in compliance
 8  
  * with the License.  You may obtain a copy of the License at
 9  
  *
 10  
  *     http://www.apache.org/licenses/LICENSE-2.0
 11  
  *
 12  
  * Unless required by applicable law or agreed to in writing, software
 13  
  * distributed under the License is distributed on an "AS IS" BASIS,
 14  
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 15  
  * See the License for the specific language governing permissions and
 16  
  * limitations under the License.
 17  
  */
 18  
 
 19  
 package org.apache.giraph.benchmark;
 20  
 
 21  
 import org.apache.giraph.graph.BasicComputation;
 22  
 import org.apache.giraph.edge.Edge;
 23  
 import org.apache.giraph.graph.Vertex;
 24  
 import org.apache.hadoop.io.DoubleWritable;
 25  
 import org.apache.hadoop.io.LongWritable;
 26  
 
 27  
 import java.io.IOException;
 28  
 
 29  
 /**
 30  
  * Shortest paths algorithm.
 31  
  */
 32  0
 public class ShortestPathsComputation extends BasicComputation<LongWritable,
 33  
     DoubleWritable, DoubleWritable, DoubleWritable> {
 34  
   /** Source id. */
 35  
   public static final String SOURCE_ID =
 36  
       "giraph.shortestPathsBenchmark.sourceId";
 37  
   /** Default source id. */
 38  
   public static final long SOURCE_ID_DEFAULT = 1;
 39  
 
 40  
   /**
 41  
    * Check if vertex is source from which to calculate shortest paths.
 42  
    *
 43  
    * @param vertex Vertex
 44  
    * @return True iff vertex is source for shortest paths
 45  
    */
 46  
   private boolean isSource(
 47  
       Vertex<LongWritable, DoubleWritable, DoubleWritable> vertex) {
 48  0
     return vertex.getId().get() ==
 49  0
         getConf().getLong(SOURCE_ID, SOURCE_ID_DEFAULT);
 50  
   }
 51  
 
 52  
   @Override
 53  
   public void compute(
 54  
       Vertex<LongWritable, DoubleWritable, DoubleWritable> vertex,
 55  
       Iterable<DoubleWritable> messages) throws IOException {
 56  0
     if (getSuperstep() == 0) {
 57  0
       vertex.setValue(new DoubleWritable(Double.MAX_VALUE));
 58  
     }
 59  
 
 60  0
     double minDist = isSource(vertex) ? 0d : Double.MAX_VALUE;
 61  0
     for (DoubleWritable message : messages) {
 62  0
       minDist = Math.min(minDist, message.get());
 63  0
     }
 64  
 
 65  0
     if (minDist < vertex.getValue().get()) {
 66  0
       vertex.setValue(new DoubleWritable(minDist));
 67  0
       for (Edge<LongWritable, DoubleWritable> edge : vertex.getEdges()) {
 68  0
         double distance = minDist + edge.getValue().get();
 69  0
         sendMessage(edge.getTargetVertexId(),
 70  
             new DoubleWritable(distance));
 71  0
       }
 72  
     }
 73  
 
 74  0
     vertex.voteToHalt();
 75  0
   }
 76  
 }