In this article, we show that the algorithm proposed by Karnopp and Rosenberg for converting a circuit into a bond graph is not fully adapted to the bond graph formalism. This formalism implicitly deletes information which is useless for describing the circuits' functioning. But this information is not systematically deleted in the bond graphs obtained with their algorithm. We propose an algorithm based on another of their method, called the inspection method. It was not yet formalized and allows to obtain bond graphs where the useless information is entirely deleted. This algorithm uses the Tutte decomposition of graphs and associates a unique bond graph with a given circuit.