Graph#

Module for otx.core.ov.graph.

class otx.core.ov.graph.Graph(*args, **kwargs)#

Graph class.

add_edge(node_from: Operation, node_to: Operation, out_port: Optional[int] = None, in_port: Optional[int] = None, **kwargs)#: Graph’s add_edge function.

adjlist_outer_dict_factory#: alias of SortedDictHelper

bfs(node: Operation, reverse: bool = False, depth_limit: Optional[int] = None) → Generator[Union[Tuple[Operation, Operation], Tuple[Operation, Tuple[Operation]]], None, None]#: Graph’s bfs function.

clean_up(nodes_to_keep: Optional[List[Operation]] = None, remove_sub_components: bool = True)#: Graph’s clean_up function.

static from_ov(ov_model: Model) → Graph#: Graph’s from_ov function.

get_edge_data(node_from: Operation, node_to: Operation, default=None) → Optional[List[Dict[Any, Any]]]#: Graph’s get_edge_data function.

get_nodes_by_type_pattern(pattern: List[str], start_node: Optional[Operation] = None, reverse=False)#: Graph’s get_nodes_by_type_pattern function.

get_nodes_by_types(types: List[str]) → List[Operation]#: Graph’s get_nodes_by_types function.

has_path(node_from: Operation, node_to: Operation)#: Graph’s has_path function.

predecessors(node: Operation, with_edge_data: bool = False) → Generator[Union[Tuple[Operation, Optional[List]], Operation], None, None]#: Graph’s predecessors function.

remove_node(node: Operation, keep_connect: bool = False)#: Graph’s remove_node function.

remove_normalize_nodes()#: Graph’s remove_normalize_nodes function.

replace_node(old_node: Operation, new_node: Operation)#: Graph’s replace_node function.

successors(node: Operation, with_edge_data: bool = False) → Generator[Union[Tuple[Operation, Optional[List]], Operation], None, None]#: Graph’s successors function.

topological_sort()#: Graph’s topological_sort function.

Modules for otx.core.ov.graph.

class otx.core.ov.graph.graph.Graph(*args, **kwargs)#

Graph class.

add_edge(node_from: Operation, node_to: Operation, out_port: Optional[int] = None, in_port: Optional[int] = None, **kwargs)#: Graph’s add_edge function.

adjlist_outer_dict_factory#: alias of SortedDictHelper

bfs(node: Operation, reverse: bool = False, depth_limit: Optional[int] = None) → Generator[Union[Tuple[Operation, Operation], Tuple[Operation, Tuple[Operation]]], None, None]#: Graph’s bfs function.

clean_up(nodes_to_keep: Optional[List[Operation]] = None, remove_sub_components: bool = True)#: Graph’s clean_up function.

static from_ov(ov_model: Model) → Graph#: Graph’s from_ov function.

get_edge_data(node_from: Operation, node_to: Operation, default=None) → Optional[List[Dict[Any, Any]]]#: Graph’s get_edge_data function.

get_nodes_by_type_pattern(pattern: List[str], start_node: Optional[Operation] = None, reverse=False)#: Graph’s get_nodes_by_type_pattern function.

get_nodes_by_types(types: List[str]) → List[Operation]#: Graph’s get_nodes_by_types function.

has_path(node_from: Operation, node_to: Operation)#: Graph’s has_path function.

predecessors(node: Operation, with_edge_data: bool = False) → Generator[Union[Tuple[Operation, Optional[List]], Operation], None, None]#: Graph’s predecessors function.

remove_node(node: Operation, keep_connect: bool = False)#: Graph’s remove_node function.

remove_normalize_nodes()#: Graph’s remove_normalize_nodes function.

replace_node(old_node: Operation, new_node: Operation)#: Graph’s replace_node function.

successors(node: Operation, with_edge_data: bool = False) → Generator[Union[Tuple[Operation, Optional[List]], Operation], None, None]#: Graph’s successors function.

topological_sort()#: Graph’s topological_sort function.

class otx.core.ov.graph.graph.NOOP#: NOOP class.

class otx.core.ov.graph.graph.SortedDict(sort_key, *args, **kwargs)#

SortedDict class.

clear()#: Sorteddict’s clear function.

static fromkeys(iterable, value=None)#: Sorteddict’s fromkeys function.

items()#: Sorteddict’s items function.

keys()#: Sorteddict’s keys function.

pop(key, default=<otx.core.ov.graph.graph.NOOP object>)#: Sorteddict’s pop function.

popitem()#: Sorteddict’s popitem function.

values()#: Sorteddict’s values function.

class otx.core.ov.graph.graph.SortedDictHelper(sort_key=None, *args, **kwargs)#: SortedDictHelper class.

class otx.core.ov.graph.graph.SortedDictItemsView(mapping)#: SortedDictItemsView class.

class otx.core.ov.graph.graph.SortedDictKeysView(mapping)#: SortedDictKeysView class.

class otx.core.ov.graph.graph.SortedDictValuesView(mapping)#: SortedDictValuesView class.

Utils for otx.core.ov.graph.

otx.core.ov.graph.utils.get_constant_input_nodes(graph: Graph, node: Operation) → List[Operation]#: Getter constant input nodes from graph, node.

otx.core.ov.graph.utils.handle_merging_into_batchnorm(graph, type_patterns=None, type_mappings=None)#: Merge function graph into batchnorm.

otx.core.ov.graph.utils.handle_paired_batchnorm(graph, replace: bool = False, types: Optional[List[str]] = None)#: Handle function paired batchnorm.

otx.core.ov.graph.utils.handle_reshape(graph)#: Reshape function.

Module for otx.core.ov.graph.parser.