Home My Page Projects Code Snippets Project Openings SML/NJ
Summary Activity Forums Tracker Lists Tasks Docs Surveys News SCM Files

SCM Repository

[smlnj] View of /MLRISC/trunk/graphs/test2.sml
ViewVC logotype

View of /MLRISC/trunk/graphs/test2.sml

Parent Directory Parent Directory | Revision Log Revision Log


Revision 2126 - (download) (annotate)
Thu Nov 2 16:11:29 2006 UTC (12 years, 8 months ago) by blume
File size: 945 byte(s)
moved MLRISC to toplevel
CM.make "../cm/Graphs.cm";
(* See page 249 of Aho Hopcroft Ullman *)
structure TestMatching =
struct
val G as Graph.GRAPH g = DirectedGraph.graph("foo",(),10) :
    (string,int,unit) Graph.graph 
val _ = app (#add_node g)
          [(1,"1"),
           (2,"2"),
           (3,"3"),
           (4,"4"),
           (5,"5"),
           (6,"6"),
           (7,"7"),
           (8,"8"),
           (9,"9"),
           (10,"10")
          ]
val _ = app (#add_edge g)
          (rev[(1,6,1),
           (1,7,1),
           (1,8,1),
           (2,6,1),
           (2,9,1),
           (2,10,1),
           (3,6,1),
           (3,7,1),
           (4,8,1),
           (4,9,1),
           (4,10,1),
           (5,6,1)
          ])
fun matching((i,j,c),_) = 
    print(Int.toString i ^ " -> " ^ Int.toString j ^ "\n")

fun test() = 
    let val (_,card) = BipartiteMatching.matching G matching ()
    in  if card <> 5 then raise Match else card
    end

end

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0