[Haskell-cafe] Benchmarks for graph algorithms

Hi cafe, Where do Haskell and DPH stand in comparison to C/OpenMP w.r.t. graph algorithms? Are benchmarks for graph algorithms available for Haskell like the ones we find at http://www.graphanalysis.org/benchmark/? - Damodar