Clean up node iteration

src/compiler/generic-algorithm-inl.h

Index: src/compiler/generic-algorithm-inl.h
diff --git a/src/compiler/generic-algorithm-inl.h b/src/compiler/generic-algorithm-inl.h
index 02292969d603a00610852848cb71b19b26115802..41280b2bd3e300e61bb7a38374340bafe3b86df7 100644
--- a/src/compiler/generic-algorithm-inl.h
+++ b/src/compiler/generic-algorithm-inl.h
@@ -19,13 +19,13 @@ template <class N>
 class NodeInputIterationTraits {
  public:
   typedef N Node;
-  typedef typename N::Inputs::iterator Iterator;
+  typedef typename N::InputEdges::iterator Iterator;
 
-  static Iterator begin(Node* node) { return node->inputs().begin(); }
-  static Iterator end(Node* node) { return node->inputs().end(); }
+  static Iterator begin(Node* node) { return node->input_edges().begin(); }
+  static Iterator end(Node* node) { return node->input_edges().end(); }
   static int max_id(Graph* graph) { return graph->NodeCount(); }
-  static Node* to(Iterator iterator) { return *iterator; }
-  static Node* from(Iterator iterator) { return iterator.edge().from(); }
+  static Node* to(Iterator iterator) { return (*iterator).to(); }
+  static Node* from(Iterator iterator) { return (*iterator).from(); }
 };
 
 }  // namespace compiler