if we take nodes to stand for NAND gates and edges to stand for connectors between those gates, a NAND circuit is equivalent to a directed graph (well, there are also input and output nodes, and input nodes can't have incoming edges, but the overall structure is roughly that of a directed graph) i wonder if there's a logic out there that is equivalent to a non-directed graph instead