Could I get a code review?

Playground URL: https://play.rust-lang.org/?gist=a53bc11473522f47fe71a7a46b54908d&version=stable&backtrace=0

Gist URL: https://gist.github.com/a53bc11473522f47fe71a7a46b54908d

This code implements a DAG data structure for Boolean circuits and has a function (compute) to evaluate them, which includes a topological sort algorithm (dfs).

In particular I’m not sure of the following are idiomatic: the data structure itself at line 26, relatives/children/parents functions at lines 34-65, depth first search at line 67, and compute at line 98.

Any help appreciated, thanks!