随机算法 (Fall 2011)/Graph Connectivity: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

29 December 2011

19 July 2011

  • curprev 15:0615:06, 19 July 2011‎ 114.212.208.2 talk‎ 2,735 bytes +2,735‎ Created page with 'USTCON stands for '''undirected <math>s</math>-<math>t</math> connectivity'''. It is the problem which asks whether there is a path from vertex <math>s</math> to vertex <math>t</…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Graph_Connectivity"