graph_helper.h 1.5 KB
Newer Older
X
better  
Xin Pan 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.

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. */

#pragma once

#include <map>
#include <memory>
#include <vector>

#include "paddle/fluid/framework/ir/graph.h"
#include "paddle/fluid/framework/ir/node.h"

namespace paddle {
namespace framework {
namespace ir {
X
Xin Pan 已提交
27
// Test if the graph contains circle.
X
better  
Xin Pan 已提交
28 29
bool HasCircle(const Graph &graph);

C
chengduo 已提交
30 31
size_t GraphNum(const Graph &graph);

X
Xin Pan 已提交
32 33
// Topology Sort the operations in the graph from inputs to outputs.
// `graph` cannot contain circle.
X
Xin Pan 已提交
34
std::vector<ir::Node *> TopologySortOperations(const Graph &graph);
X
better  
Xin Pan 已提交
35

X
Xin Pan 已提交
36
// Build an adjacency list of operations for the `graph`.
X
Xin Pan 已提交
37
std::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationAdjList(
X
better  
Xin Pan 已提交
38
    const Graph &graph);
X
Xin Pan 已提交
39

X
Xin Pan 已提交
40
template <typename T>
X
Xin Pan 已提交
41
std::vector<T *> FilterByNodeWrapper(const Graph &graph) {
X
Xin Pan 已提交
42 43 44 45 46 47 48
  std::vector<T *> ret;
  for (ir::Node *n : graph.Nodes()) {
    if (n->IsWrappedBy<T>()) ret.push_back(&n->Wrapper<T>());
  }
  return ret;
}

X
better  
Xin Pan 已提交
49 50 51
}  // namespace ir
}  // namespace framework
}  // namespace paddle