diff --git a/tests/ut/ge/CMakeLists.txt b/tests/ut/ge/CMakeLists.txt
index 295e03f4..1df848d5 100755
--- a/tests/ut/ge/CMakeLists.txt
+++ b/tests/ut/ge/CMakeLists.txt
@@ -752,7 +752,6 @@ set(MULTI_PARTS_TEST_FILES
     "graph/variable_accelerate_ctrl_unittest.cc"
     "graph/build/logical_stream_allocator_unittest.cc"
     "graph/build/mem_assigner_unittest.cc"
-    "graph/build/graph_builder_unittest.cc"
     "graph/preprocess/graph_preprocess_unittest.cc"
     "graph/manager/hcom_util_unittest.cc"
     "graph/manager/graph_caching_allocator_unittest.cc"
diff --git a/tests/ut/ge/graph/build/graph_builder_unittest.cc b/tests/ut/ge/graph/build/graph_builder_unittest.cc
deleted file mode 100644
index 4855762f..00000000
--- a/tests/ut/ge/graph/build/graph_builder_unittest.cc
+++ /dev/null
@@ -1,108 +0,0 @@
-/**
- * Copyright 2019-2020 Huawei Technologies Co., Ltd
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-#include <string>
-#include <vector>
-#include <gtest/gtest.h>
-
-#define protected public
-#define private public
-#include "graph/manager/graph_manager_utils.h"
-#undef protected
-#undef private
-
-#include "graph/build/graph_builder.h"
-
-#include "common/types.h"
-#include "common/util.h"
-
-#include "graph/compute_graph.h"
-#include "graph/utils/attr_utils.h"
-#include "graph/utils/graph_utils.h"
-
-using namespace std;
-
-
-class UtestGraphBuilder : public testing::Test {
- protected:
-  void SetUp() {}
-
-  void TearDown() {}
-
-  void MakeGraph(ge::ComputeGraphPtr &graph) {
-    ge::OpDescPtr op_def_a = CreateOpWithWsSize("A", 6000);
-    op_def_a->SetStreamId(0);
-    ge::OpDescPtr op_def_b = CreateOpWithWsSize("B", 120000);
-    op_def_b->SetStreamId(0);
-    ge::OpDescPtr op_def_c = CreateOpWithWsSize("C", 16000);
-    op_def_c->SetStreamId(1);
-    ge::OpDescPtr op_def_d = CreateOpWithWsSize("D", 24000);
-    op_def_d->SetStreamId(2);
-    ge::OpDescPtr op_def_e = CreateOpWithWsSize("E", 24000);
-    op_def_e->SetStreamId(3);
-    ge::OpDescPtr op_def_f = CreateOpWithWsSize("F", 30000);
-    op_def_f->SetStreamId(2);
-    ge::OpDescPtr op_def_g = CreateOpWithWsSize("G", 32000);
-    op_def_g->SetStreamId(3);
-    ge::OpDescPtr op_def_h = CreateOpWithWsSize("H", 48000);
-    op_def_h->SetStreamId(2);
-    ge::OpDescPtr op_def_i = CreateOpWithWsSize("I", 60000);
-    op_def_i->SetStreamId(2);
-    ge::OpDescPtr op_def_j = CreateOpWithWsSize("J", 256000, NETOUTPUT);
-    op_def_j->SetStreamId(3);
-
-    // add node
-    ge::NodePtr node_a = graph->AddNode(op_def_a);
-    ge::NodePtr node_b = graph->AddNode(op_def_b);
-    ge::NodePtr node_c = graph->AddNode(op_def_c);
-    ge::NodePtr node_d = graph->AddNode(op_def_d);
-    ge::NodePtr node_e = graph->AddNode(op_def_e);
-    ge::NodePtr node_f = graph->AddNode(op_def_f);
-    ge::NodePtr node_g = graph->AddNode(op_def_g);
-    ge::NodePtr node_h = graph->AddNode(op_def_h);
-    ge::NodePtr node_i = graph->AddNode(op_def_i);
-    ge::NodePtr node_j = graph->AddNode(op_def_j);
-
-    // add edge
-    ge::GraphUtils::AddEdge(node_a->GetOutDataAnchor(0), node_b->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_a->GetOutDataAnchor(0), node_c->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_b->GetOutDataAnchor(0), node_d->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_b->GetOutDataAnchor(0), node_e->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_c->GetOutDataAnchor(0), node_g->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_d->GetOutDataAnchor(0), node_f->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_e->GetOutDataAnchor(0), node_g->GetInDataAnchor(1));
-    ge::GraphUtils::AddEdge(node_f->GetOutDataAnchor(0), node_h->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_g->GetOutDataAnchor(0), node_j->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_h->GetOutDataAnchor(0), node_i->GetInDataAnchor(0));
-    ge::GraphUtils::AddEdge(node_i->GetOutDataAnchor(0), node_j->GetInDataAnchor(1));
-
-    GetContext().out_nodes_map["H"] = {0};
-    GetContext().out_nodes_map["I"] = {0};
-    GetContext().out_nodes_map["J"] = {0};
-    graph->TopologicalSorting();
-  }
-};
-
-
-TEST_F(UtestGraphBuilder, BuildForKnownShapeGraph_test) {
-  ge::ComputeGraphPtr graph = make_shared<ge::ComputeGraph>("");
-  MakeGraph(graph);
-
-  //ge::GraphBuilder builder;
-  //ge::GeRootModelPtr ge_root_model = nullptr;
-  //builder.Build(graph, ge_root_model, 1);
- }
-