// Test of closest pair algorithms
// David Eppstein, UC Irvine, 19 Apr 1997
//
// Common include file to gather all applications of closest pair data strux.
#include "GreedyMatching.h"
#include "MultiFragment.h"
#include "Cluster.h"
#include "CheapestInsertion.h"
#include "Tron.h"
</div><div class="naked_ctrl">
<form action="/index.cgi/larger-text" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://ics.uci.edu/~eppstein/projects/pairs/Source/testbed/AllAlgorithms.h">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://ics.uci.edu/~eppstein/projects/pairs/Source/testbed/AllAlgorithms.h" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast">配色反転</option>
<option value="larger-text" selected="selected">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>