@@ -966,7 +966,7 @@ inline int edge(int min, int max, int gno) {
966966 return ((gno-1 )*(min+1 )-min*(min-1 )/2 +max-min); // this includes source to node edges
967967}
968968
969- GBitVec traverse_dfs (int s,int g,CGraphnode *node,CGraphnode *sink,GBitVec parents,int gno,GVec<bool >& visit,
969+ GBitVec traverse_dfs (int s,int g,CGraphnode *node,CGraphnode *sink,GBitVec parents,int gno, GVec<bool >& visit,
970970 GPVec<CGraphnode> **no2gnode,GPVec<CTransfrag> **transfrag){
971971
972972 if (visit[node->nodeid ]) {
@@ -1847,14 +1847,19 @@ void process_transfrags(int gno,GPVec<CGraphnode>& no2gnode,GPVec<CTransfrag>& t
18471847
18481848 // if(!EM) {
18491849 if (0 ) {
1850- GVec<float > n[gno]; // abundances of all transfrags passing through node and leaving node
1851- GVec<float > f[gno]; // abundances of all transfrags leaving node
1850+ GVec<float > f_init (gno, float (0 ));
1851+ GVec< GVec<float > > n (gno, &f_init, false );
1852+ // GVec<float> n[gno]; // abundances of all transfrags passing through node and leaving node
1853+ GVec< GVec<float > > f (gno, &f_init, false );
1854+ // GVec<float> f[gno]; // abundances of all transfrags leaving node
1855+ // GVec< GVec<int> > u(gno, new GVec<int>(gno,0) );
18521856 // GVec<int> u[gno]; // transfrags that are uncommited to a specific child; this is a more complicated issue -> ignore for now
1857+ /*
18531858 for(int i=1;i<gno-1;i++) {
18541859 n[i].Resize(gno,0);
18551860 f[i].Resize(gno,0);
18561861 }
1857-
1862+ */
18581863 for (int t=0 ;t<transfrag.Count ();t++)
18591864 if (transfrag[t]->nodes [0 ] && transfrag[t]->nodes .Count ()) { // transfrag has more than one node, and doesn't start at source
18601865 for (int i=0 ;i<transfrag[t]->nodes .Count ()-1 ;i++) { // for all nodes in transfrags that are not last
@@ -8732,7 +8737,7 @@ int print_cluster_inclusion(GPVec<CPrediction>& pred,GVec<int>& genes,GVec<int>&
87328737 // sort predictions from the one with the most exons to the one with the least:
87338738 pred.Sort (predexCmp);
87348739
8735- GVec<int > included[ pred.Count ()] ;
8740+ GVec< GVec< int > > included ( pred.Count ()); included. Resize (pred. Count ()) ;
87368741 GVec<float > maxcov;
87378742 GVec<float > totalcov;
87388743
@@ -9000,7 +9005,7 @@ int printResults(BundleData* bundleData, int ngenes, int geneno, GStr& refname)
90009005 */
90019006
90029007 // this version is more inclusive by stiching together single exons to reference guides that overlap them
9003- GVec<int > reflink[ npred] ;
9008+ GVec< GVec< int > > reflink ( npred); reflink. Resize (npred) ;
90049009 for (int n=0 ;n<npred;n++) {
90059010
90069011 if (pred[n] && pred[n]->t_eq ) {
0 commit comments