Skip to content

Latest commit

 

History

History
50 lines (50 loc) · 5.51 KB

PR-README.md

File metadata and controls

50 lines (50 loc) · 5.51 KB
Raw

methods need to implement

  • [✔] std::unordered_set get_sources(DiGraphView const &);(lib/utils/include/utils/graph/algorithms.h)
  • [✔] std::unordered_set get_sources(MultiDiGraphView const &); (lib/utils/include/utils/graph/algorithms.h)
  • [✔] get_sinks lib/utils/include/utils/graph/algorithms.h
  • all view_as_joined method (lib/utils/include/utils/graph/views.h)
  • [✔] MultiDiEdgeQuery query_intersection(MultiDiEdgeQuery const &, MultiDiEdgeQuery const &)( lib/utils/include/utils/graph/multidigraph.h)
  • [✔] JoinNodeKey::operator==(lib/utils/include/utils/graph/views.h)
  • [✔] JoinNodeKey(Node const &, LRDirection)(lib/utils/include/utils/graph/views.h)
  • UndirectedGraphView::operator GraphView&() (lib/utils/include/utils/graph/digraph.h)
  • [✔] unsafe_view_as_flipped(DiGraphView const&) (lib/utils/include/utils/graph/views.h)
  • [] query_intersection(DirectedEdgeQuery const& (lib/utils/include/utils/graph/digraph.h)
  • [✔] DiGraphView(std::shared_ptr<IDiGraphView const> (lib/utils/include/utils/graph/digraph.h)
  • [✔] AdjacencyDiGraph(std::size_t, ContentsType) (lib/utils/include/utils/graph/adjacency_digraph.h)
  • [✔] operator maybe_owned_ref<IUndirectedGraphView const>() const (lib/utils/include/utils/graph/undirected.h)
  • MultiDiGraphView unsafe(IMultiDiGraphView const &) (lib/utils/include/utils/graph/multidigraph.h)
  • [✔] InputMultiDiEdge(std::pair<std::size_t, std::size_t> const &, Node const &, std::size_t const &) （lib/utils/include/utils/graph/open_graph_interfaces.h）
  • [✔] operator maybe_owned_ref<IMultiDiGraphView const>() const (lib/utils/include/utils/graph/multidigraph.h)
  • tl::optional<Node> get_imm_post_dominator(DiGraphView const &, Node const &) (lib/utils/include/utils/graph/algorithms.h)
  • [✔] UndirectedGraphView(std::shared_ptr<IUndirectedGraphView const>) (lib/utils/include/utils/graph/undirected.h)
  • std::vector<std::unordered_set<Node>> get_weakly_connected_components(DiGraphView const &)(lib/utils/include/utils/graph/algorithms.h)
  • operator GraphView() const(lib/utils/include/utils/graph/digraph.h)
  • [✔] NodeQuery query_intersection(NodeQuery const &, NodeQuery const &) (lib/utils/include/utils/graph/node.h)
  • operator UndirectedGraphView() const (lib/utils/include/utils/graph/adjacency_multidigraph.h)
  • [✔] SplitASTNode(SplitType) (lib/utils/src/graph/serialparallel_internal.h)
  • [✔] operator maybe_owned_ref<IUndirectedGraphView const>() const(lib/utils/src/graph/serialparallel_internal.h)
  • [✔] std::unordered_set<Node> get_nodes(GraphView const &) (lib/utils/include/utils/graph/algorithms.h)
  • [✔] std::size_t operator()(::FlexFlow::JoinNodeKey const &) const(lib/utils/include/utils/graph/views.h)
  • MultiDiGraphView unsafe_view_as_multidigraph(DiGraphView const &)(lib/utils/include/utils/graph/conversions.h)
  • DiGraphView unsafe_view_as_contracted(DiGraphView const &, std::unordered_map<Node, Node> const &)(lib/utils/include/utils/graph/conversions.h)
  • [✔] MultiDiInput(Node const &, size_t) (lib/utils/include/utils/graph/labelled_graph_interfaces.h)
  • DiGraphView unsafe(IDiGraphView const &) (lib/utils/include/utils/graph/digraph.h)
  • [✔] virtual ~IUndirectedGraphView() (lib/utils/include/utils/graph/undirected.h)
  • [✔] bool operator==(DiGraphView const &) const (lib/utils/include/utils/graph/digraph.h)
  • DiGraphView unsafe_view_as_digraph(MultiDiGraphView const &)(lib/utils/include/utils/graph/conversions.h)
  • [✔] virtual ~IDiGraphView() （lib/utils/include/utils/graph/digraph.h）
  • UndirectedGraphView unsafe(IUndirectedGraphView const &)(lib/utils/include/utils/graph/undirected.h)
  • static GraphView unsafe(IGraphView const &)(lib/utils/include/utils/graph/node.h)
  • [✔] SplitASTNode(SplitType, SplitAST const &, SplitAST const &)(lib/utils/src/graph/serialparallel_internal.h)
  • [✔] bool operator!=(DiGraphView const &) const(lib/utils/include/utils/graph/digraph.h)
  • [✔] MultiDiOutput(Node const &, size_t)(lib/utils/include/utils/graph/labelled_graph_interfaces.h)
  • [✔] std::size_t num_nodes(GraphView const &) (lib/utils/include/utils/graph/algorithms.h)
  • [✔] std::unordered_set<Node> query_nodes(NodeQuery const &) const override(lib/utils/include/utils/graph/views.h)
  • MultiDiSubgraphView::query_nodes(NodeQuery const&) const(lib/utils/include/utils/graph/undirected.h)
  • [✔] std::unordered_set<Edge> UndirectedGraphView::query_edges(EdgeQuery const &) const(lib/utils/include/utils/graph/undirected.h)
  • [✔] OutputMultiDiEdge::OutputMultiDiEdge(std::pair<std::size_t, std::size_t> const &, Node const &, std::size_t const &)(lib/utils/include/utils/graph/open_graph_interfaces.h)
  • [ ✔] InputMultiDiEdge::InputMultiDiEdgelib/utils/include/utils/graph/open_graph_interfaces.h
  • [✔] AdjacencyMultiDiGraph::AdjacencyMultiDiGraph(unsigned long lib/utils/include/utils/graph/adjacency_multidigraph.h
  • [✔] MultiDiInput::MultiDiInput(FlexFlow::Node const&, unsigned long) (lib/utils/include/utils/graph/labelled_graph_interfaces.h)
  • [✔] MultiDiGraphView::query_edges(MultiDiEdgeQuery const&) const(lib/utils/include/utils/graph/multidigraph.h)
  • [✔] UndirectedGraphView::query_edges(EdgeQuery const (lib/utils/include/utils/graph/undirected.h)