Graph representation benchmarking

Posted by Carlucho on Stack Overflow See other posts from Stack Overflow or by Carlucho
Published on 2010-04-16T23:44:15Z Indexed on 2010/04/16 23:53 UTC
Read the original article Hit count: 315

Currently am developing a program that solves (if possible) any given labyrinth of dimensions from 3X4 to 26x30. I represent the graph using both adj matrix (sparse) and adj list. I would like to know how to output the total time taken by the DFS to find the solution using one and then the other method. Programatically, how could i produce such benchmark?

© Stack Overflow or respective owner

Related posts about graphs

Related posts about benchmarking