ZigZag - Deep Learning Hardware Design Space Exploration
This repository presents the novel version of our tried-and-tested hardware Architecture-Mapping Design Space Exploration (DSE) Framework for Deep Learning (DL) accelerators. ZigZag bridges the gap between algorithmic DL decisions and their acceleration cost on specialized accelerators through a fast and accurate hardware cost estimation.
DiGraphWrapper Member List

This is the complete list of members for DiGraphWrapper, including all inherited members.

add_edge(self, T edge_from, T edge_to)DiGraphWrapper
add_edges_from(self, Sequence[tuple[T, T]|tuple[T, T, Any]] edges)DiGraphWrapper
add_node(self, T node)DiGraphWrapper
add_nodes_from(self, Sequence[T] node)DiGraphWrapper
all_simple_paths(self, T producer, T consumer)DiGraphWrapper
get_node_with_id(self, int node_id)DiGraphWrapper
in_degree(self)DiGraphWrapper
in_edges(self, T node, Literal[False] data)DiGraphWrapper
in_edges(self, T node, Literal[True] data)DiGraphWrapper
in_edges(self, T node)DiGraphWrapper
in_edges(self, T node, bool data=False)DiGraphWrapper
node_list(self)DiGraphWrapper
out_degree(self, Literal[None] node)DiGraphWrapper
out_degree(self)DiGraphWrapper
out_degree(self, T node)DiGraphWrapper
out_degree(self, T|None node=None)DiGraphWrapper
out_edges(self, T node, Literal[True] data)DiGraphWrapper
out_edges(self, T node, Literal[False] data)DiGraphWrapper
out_edges(self, T node)DiGraphWrapper
out_edges(self, T node, bool data=False)DiGraphWrapper
predecessors(self, T node)DiGraphWrapper
remove_nodes_from(self, Iterator[T] nodes)DiGraphWrapper
shortest_path(self, T producer, T consumer)DiGraphWrapper
successors(self, T node)DiGraphWrapper
topological_sort(self)DiGraphWrapper