Coverage Report - org.apache.giraph.examples.scc.SccVertexValue
 
Classes in this File Line Coverage Branch Coverage Complexity
SccVertexValue
0%
0/37
0%
0/12
1.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  
 package org.apache.giraph.examples.scc;
 19  
 
 20  
 import it.unimi.dsi.fastutil.longs.LongArrayList;
 21  
 
 22  
 import java.io.DataInput;
 23  
 import java.io.DataOutput;
 24  
 import java.io.IOException;
 25  
 
 26  
 import org.apache.hadoop.io.Writable;
 27  
 
 28  
 /**
 29  
  * Vertex value for the Strongly Connected Components algorithm. It keeps track
 30  
  * of the parents of the vertex in order to traverse the graph backwards.
 31  
  */
 32  
 public class SccVertexValue implements Writable {
 33  
 
 34  
   /** Vertex's parents **/
 35  
   private LongArrayList parents;
 36  
 
 37  
   /** Current vertex value **/
 38  0
   private long value = Long.MIN_VALUE;
 39  
 
 40  
   /** Indicates whether the vertex was trimmed, hence,
 41  
    * it can't be part of the computation anymore.
 42  
    */
 43  0
   private boolean active = true;
 44  
 
 45  
   /**
 46  
    * Public constructor required for serialization.
 47  
    */
 48  0
   public SccVertexValue() {
 49  0
   }
 50  
 
 51  
   /**
 52  
    * Constructor
 53  
    * @param value Initial value for this vertex.
 54  
    */
 55  0
   public SccVertexValue(long value) {
 56  0
     this.value = value;
 57  0
   }
 58  
 
 59  
   @Override
 60  
   public void readFields(DataInput in) throws IOException {
 61  0
     value = in.readLong();
 62  
 
 63  0
     int size = in.readInt();
 64  0
     if (size != 0) {
 65  0
       for (int i = 0; i < size; i++) {
 66  0
         addParent(in.readLong());
 67  
       }
 68  
     }
 69  
 
 70  0
     active = in.readBoolean();
 71  0
   }
 72  
 
 73  
   @Override
 74  
   public void write(DataOutput out) throws IOException {
 75  0
     out.writeLong(value);
 76  
 
 77  0
     int size = parents == null ? 0 : parents.size();
 78  0
     out.writeInt(size);
 79  0
     if (size != 0) {
 80  0
       for (long incomingId : parents) {
 81  0
         out.writeLong(incomingId);
 82  0
       }
 83  
     }
 84  
 
 85  0
     out.writeBoolean(active);
 86  0
   }
 87  
 
 88  
   /**
 89  
    * Returns the list of parent vertices, i.e., vertices that are at the other
 90  
    * end of incoming edges. If the vertex doesn't have any incoming edge, it
 91  
    * returns null.
 92  
    * @return List of the vertex's parents.
 93  
    */
 94  
   public LongArrayList getParents() {
 95  0
     return parents;
 96  
   }
 97  
 
 98  
   /**
 99  
    * Adds a vertex id to the list of parent vertices.
 100  
    * @param vertexId It of the parent vertex.
 101  
    */
 102  
   public void addParent(long vertexId) {
 103  
     // Initialize the list of parent vertices only when one attempts to add
 104  
     // the first item, so we save some memory on vertices that have no incoming
 105  
     // edges
 106  0
     if (parents == null) {
 107  0
       parents = new LongArrayList();
 108  
     }
 109  0
     parents.add(vertexId);
 110  0
   }
 111  
 
 112  
   /**
 113  
    * Clear parents list.
 114  
    */
 115  
   public void clearParents() {
 116  0
     parents = null;
 117  0
   }
 118  
 
 119  
   /**
 120  
    * Sets the vertex value. At the end of the SCC computation, vertices with the
 121  
    * same vertex value are part of the same component.
 122  
    * @param value Vertex value.
 123  
    */
 124  
   public void set(long value) {
 125  0
     this.value = value;
 126  0
   }
 127  
 
 128  
   /**
 129  
    * Returns the vertex value. At the end of the SCC computation, vertices with
 130  
    * the same vertex value are part of the same component.
 131  
    * @return Current vertex value.
 132  
    */
 133  
   public long get() {
 134  0
     return value;
 135  
   }
 136  
 
 137  
   /**
 138  
    * Remove this vertex from the computation.
 139  
    */
 140  
   public void deactivate() {
 141  0
     this.active = false;
 142  0
   }
 143  
 
 144  
   /**
 145  
    * Indicates whether the vertex was removed in a Trimming phase.
 146  
    * @return True if the vertex was trimmed, otherwise, return false.
 147  
    */
 148  
   public boolean isActive() {
 149  0
     return active;
 150  
   }
 151  
 
 152  
   @Override
 153  
   public String toString() {
 154  0
     return String.valueOf(value);
 155  
   }
 156  
 
 157  
 }