De-generify the GenericGraph.

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 32d42bad813906cb61104710c24865b26b79a86a..120a716324c23effeda3c482ab290741866e1dfa 100644
--- a/src/compiler/generic-algorithm-inl.h
+++ b/src/compiler/generic-algorithm-inl.h
@@ -8,9 +8,9 @@
 #include <vector>
 
 #include "src/compiler/generic-algorithm.h"
-#include "src/compiler/generic-graph.h"
 #include "src/compiler/generic-node.h"
 #include "src/compiler/generic-node-inl.h"
+#include "src/compiler/graph.h"
 
 namespace v8 {
 namespace internal {
@@ -24,7 +24,7 @@ class NodeInputIterationTraits {
 
   static Iterator begin(Node* node) { return node->inputs().begin(); }
   static Iterator end(Node* node) { return node->inputs().end(); }
-  static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); }
+  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(); }
 };