# Copyright 2021 MONAI Consortium
# 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.
from typing import Dict, Generator, Optional, Set
import networkx as nx
from networkx.algorithms.dag import topological_sort
from monai.deploy.core.operator import Operator
from .graph import Graph
[docs]class NetworkXGraph(Graph):
"""NetworkX graph implementation."""
def __init__(self, **kwargs: Dict):
self._graph = nx.DiGraph()
[docs] def add_operator(self, op: Operator):
self._graph.add_node(op)
[docs] def add_flow(self, op_u: Operator, op_v: Operator, io_map: Dict[str, Set[str]]):
self._graph.add_edge(op_u, op_v, io_map=io_map)
[docs] def get_io_map(self, op_u: Operator, op_v) -> Dict[str, Set[str]]:
io_map: Dict[str, Set[str]] = self._graph.get_edge_data(op_u, op_v).get("io_map")
return io_map
[docs] def is_root(self, op: Operator) -> bool:
return bool(self._graph.in_degree(op) == 0)
[docs] def is_leaf(self, op: Operator) -> bool:
return bool(self._graph.out_degree(op) == 0)
[docs] def get_root_operators(self) -> Generator[Operator, None, None]:
return (op for (op, degree) in self._graph.in_degree() if degree == 0)
[docs] def get_operators(self) -> Generator[Operator, None, None]:
return (op for op in self._graph.nodes())
[docs] def gen_worklist(self) -> Generator[Optional[Operator], None, None]:
worklist: Generator[Optional[Operator], None, None] = topological_sort(self._graph)
return worklist
[docs] def gen_next_operators(self, op: Operator) -> Generator[Optional[Operator], None, None]:
for _, v in self._graph.out_edges(op):
yield v