module Main where
  import AdjacencyList
  import Dijkstra
  import HUnit
  import PropertyMap

  g = adj_list 5 [(0,1),(1,2),(1,3),(3,4),(0,4)]
  s = vertex 0
  d = init_map (vertices g) 100.0
  w = create_map [(edge 0 1, 0.5), (edge 1 2, 5.6), (edge 1 3, 0.2), 
		  (edge 3 4, 0.1), (edge 0 4, 3.2)] 0.0
  (dist,p) = dijkstra_shortest_paths g s d w (<) (+) 0.0

  test1 = TestCase (assertEqual "0.8 (get dist (vertex 4))"
		    0.8 (get dist (vertex 4)))

  tests = TestList [TestLabel "test1" test1]

  main = do runTestTT tests