File: min-cut.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 (13 lines) | stat: -rw-r--r-- 341 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
 
(*
 * Minimal cut of a graph.  The graph is treated as undirected.
 * Note: the graph must be simple!
 * 
 * -- Allen
 *)
signature MIN_CUT =
sig
   structure Num : ABELIAN_GROUP
   val min_cut : { graph  : ('n,'e,'g) Graph.graph,
                   weight : 'e Graph.edge -> Num.elem
                 } -> Graph.node_id list * Num.elem
end