Analog implementation of BRIN for optimization problems

The binary relation inference network (BRIN) shows promise in obtaining the global optimal solution in a time independent of the problem size. However, the realization of this merge is dependent on the implementation platforms. In this paper, analog implementation of BRIN for two different directed graph problems is studied. As transitive closure problems can transform to a special case of shortest path problems or a special case of maximum spanning tree problems, two different forms of BRIN are discussed. Their circuits using common nalog integrated circuits are investigated. Also, the BRIN solution for critical path problems is expreassed. It is implemented using the separated building block circuit and the combined building block circuit. As these circuits are different, the response time of the network will be different. However, a simple circuit does not promise to give a faster solution time for BRIN.