Fig. 4: Node partition algorithm for path traversal.
From: Artificial molecular communication network based on DNA nanostructures recognition
a The representation, adjacency matrix, and definition of nodes of the seven-node Hamilton graph G. The number of nonzero elements in the corresponding row is the outdegree (OD), and the number of nonzero elements in the corresponding column is the indegree (ID). b The node analysis and node partition of N 1. The red cross indicates the blocking the outgoing path. c Table of the node partition result for G. d The flow chart of node partition algorithm for graph traversal. e The path traversal tree for G.
