File: spanning-tree.sig

package info (click to toggle)
mlton 20210117%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 58,464 kB
  • sloc: ansic: 27,682; sh: 4,455; asm: 3,569; lisp: 2,879; makefile: 2,347; perl: 1,169; python: 191; pascal: 68; javascript: 7
file content (19 lines) | stat: -rw-r--r-- 465 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
(*
 * Signature for the minimal cost spanning tree problem.
 * All spanning tree edges are folded together with a user supplied
 * function.
 * 
 * -- Allen
 *)

signature MIN_COST_SPANNING_TREE =
sig

   exception Unconnected

   val spanning_tree : { weight    : 'e Graph.edge -> 'w,
                         <         : 'w * 'w -> bool
                       } -> ('n, 'e, 'g) Graph.graph 
                         -> ('e Graph.edge * 'x -> 'x) -> 'x -> 'x
end