We previously introduced the length-only discrimination (LOD) method for generate and search models of DNA computing. Here we report experimental confirmation of the validity of the basic operations of LOD method. We created a test graph consisting of four nodes and three edges, in which multiple paths are possible. Experimental results indicate that primitive operations required to implement LOD method work efficiently. We conclude that further work is needed to test the efficiency and practicality of applying LOD methodology to larger graphs.