Go to the source code of this file.
Go to the SVN repository for this file.
◆ Done ◆ EDGE_LABEL_LENGTH #define EDGE_LABEL_LENGTH 50Definition at line 44 of file graph.h.
◆ EXIT_FAILURE #define EXIT_FAILURE (-1)Definition at line 61 of file graph.h.
◆ false_fastme ◆ FALSE_FASTME ◆ MAX_LABEL_LENGTH #define MAX_LABEL_LENGTH 50Definition at line 42 of file graph.h.
◆ MAXSIZE ◆ NODE_LABEL_LENGTH #define NODE_LABEL_LENGTH 50Definition at line 43 of file graph.h.
◆ ReadEntries ◆ ReadLabel ◆ ReadOpenParenthesis #define ReadOpenParenthesis 0Definition at line 64 of file graph.h.
◆ ReadSize ◆ ReadSubTree ◆ ReadWeight ◆ true_fastme ◆ TRUE_FASTME ◆ meEdge ◆ meNode ◆ meSet ◆ meTree ◆ addToSet() ◆ makeEdge()Definition at line 90 of file graph.cpp.
References meEdge::distance, meEdge::head, head, meEdge::label, label, malloc(), meEdge::tail, meEdge::totalweight, and weight.
Referenced by BMEaddSpecies(), BMEsplitEdge(), copyEdge(), decodeNewickSubtree(), GMEaddSpecies(), and GMEsplitEdge().
◆ makeNewNode() ◆ makeNode()Definition at line 75 of file graph.cpp.
References meNode::index, meNode::index2, meNode::label, label, meNode::leftEdge, malloc(), meNode::middleEdge, NULL, meNode::parentEdge, and meNode::rightEdge.
Referenced by copyNode(), decodeNewickSubtree(), and makeNewNode().
◆ newTree()RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4