|
Augustus 3.4.0
|
This is the complete list of members for Graph, including all inherited members.
| addBackEdges() (defined in Graph) | Graph | |
| addBackEdgesComp() (defined in Graph) | Graph | |
| addCompatibleEdges() (defined in Graph) | Graph | protected |
| addEdgeFromHead(Status *exon)=0 (defined in Graph) | Graph | protectedpure virtual |
| addEdgeToTail(Status *exon)=0 (defined in Graph) | Graph | protectedpure virtual |
| addExon(Status *exon, vector< Node * > &neutralLine) (defined in Graph) | Graph | protected |
| addPair(Status *exon1, Status *exon2, vector< Node * > &neutralLine) (defined in Graph) | Graph | protected |
| addToHash(Node *n) (defined in Graph) | Graph | inlineprotected |
| addWeightToEdge() (defined in Graph) | Graph | protected |
| alreadyProcessed(T *temp) (defined in Graph) | Graph | inline |
| alreadyProcessed(string key) (defined in Graph) | Graph | inline |
| buildGraph() (defined in Graph) | Graph | |
| calculateBaseScores()=0 (defined in Graph) | Graph | protectedpure virtual |
| compatible(Node *exon1, Node *exon2)=0 (defined in Graph) | Graph | protectedpure virtual |
| createNeutralLine(vector< Node * > &neutralLine, double weight=0.0, bool onlyComplete=false) (defined in Graph) | Graph | protected |
| edgeExists(Node *e1, Node *e2) (defined in Graph) | Graph | protected |
| existingNodes (defined in Graph) | Graph | |
| exonAtGeneEnd(Status *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| exonAtGeneStart(Status *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| getAvgBaseProb(Status *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| getAvgBaseProb(ExonCandidate *ec)=0 (defined in Graph) | Graph | protectedpure virtual |
| getIntronScore(Status *predExon, Status *nextExon)=0 (defined in Graph) | Graph | protectedpure virtual |
| getKey(Node *n)=0 (defined in Graph) | Graph | protectedpure virtual |
| getKey(Status *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| getKey(State *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| getKey(ExonCandidate *exoncand)=0 (defined in Graph) | Graph | protectedpure virtual |
| getNode(T *temp) (defined in Graph) | Graph | inline |
| getNode(string key) (defined in Graph) | Graph | inline |
| getSizeNeutralLine() (defined in Graph) | Graph | protected |
| Graph(list< Status > *states) (defined in Graph) | Graph | inline |
| head (defined in Graph) | Graph | |
| insertIntron(Node *exon1, Node *exon2) (defined in Graph) | Graph | protected |
| max (defined in Graph) | Graph | |
| mergedStopcodon(Node *exon1, Node *exon2)=0 (defined in Graph) | Graph | protectedpure virtual |
| mergedStopcodon(Status *exon1, Status *exon2)=0 (defined in Graph) | Graph | protectedpure virtual |
| mergedStopcodon(StateType type1, StateType type2, int end1, int begin2)=0 (defined in Graph) | Graph | protectedpure virtual |
| min (defined in Graph) | Graph | |
| minInQueue(queue< Node * > *q) (defined in Graph) | Graph | protected |
| nodelist (defined in Graph) | Graph | |
| nonneutralIncomingEdge(Node *exon) (defined in Graph) | Graph | protected |
| printGraph(string filename)=0 (defined in Graph) | Graph | protectedpure virtual |
| printGraph2(string filename)=0 (defined in Graph) | Graph | protectedpure virtual |
| printGraphToShell() (defined in Graph) | Graph | protected |
| setScore(Status *st)=0 (defined in Graph) | Graph | protectedpure virtual |
| statelist (defined in Graph) | Graph | |
| tail (defined in Graph) | Graph | |
| tarjan() (defined in Graph) | Graph | |
| tarjanAlg(Node *from, stack< Node * > &S, size_t &index) (defined in Graph) | Graph | |
| ~Graph() (defined in Graph) | Graph | virtual |
1.9.8