00001 #ifndef TREESORT_H
00002 #define TREESORT_H
00003
00004 #include <iostream>
00005 #include "tree.h"
00006 #include "treesearch.h"
00007
00012 class treesort{
00013
00014 public:
00015 treesort();
00016 ~treesort();
00017 double doubletrack;
00018 int good;
00019
00020 int rcTreeConnSort( TreeLine *head, enum ERegion region
00021
00022 );
00023 double chiweight( TreeLine *tl );
00024 int connectiv( char *ca, int *array, int *isvoid, char size, int idx );
00025 int rcCommonWires( TreeLine *line1, TreeLine *line2 );
00026 int rcCommonWires_r3( TreeLine *line1, TreeLine *line2 );
00027 int connectarray( char *ca, int *array, int *isvoid, char size, int idx );
00028 void bestunconnected( char *ca, int *array, int *isvoid, double *chia,
00029 int size, int idx);
00030 int bestconnected( char *ca, int *array, int *isvoid, double *chia,
00031 int size, int idx);
00032 int globalconnectiv( char *ca, int *array, int *isvoid, int size, int idx);
00033
00034
00035
00036 int rcPartConnSort( PartTrack *head
00037
00038 );
00039 double ptchiweight( PartTrack *pt );
00040 int rcPTCommonWires( PartTrack *track1, PartTrack *track2 );
00041
00042 private:
00043
00044
00045 };
00046
00047
00048 #endif