{-  Exploring Languages with Interpreters and Functional Programming
    Chapter 23: Data Abstraction Revisited
    Labeled Digraph ADT, Using Haskell Map, Smoke Test Driver
    Copyright (C) 2015, 2018, H. Conrad Cunningham

1234567890123456789012345678901234567890123456789012345678901234567890

2015-02_02: Began development
2018-08-04: Adapt for ELIFP textbook, Chapter 23

NOTE: No comprehensive test script available as yet

-}

module DigraphADT_TestMap
where

import DigraphADT_Map

g0  = (new_graph :: Digraph Int Int Int)
g1  = add_vertex g0 1 101
g2  = add_vertex g1 3 103
g3  = add_vertex g2 2 102
g4  = add_edge g3 1 2 1001
g5  = add_edge g4 3 1 1003
g6  = add_edge g5 2 3 1002
g7  = add_edge g6 1 1 10011