A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/graph_8cpp_source.html below:

NCBI C++ ToolKit: src/algo/phy_tree/fastme/graph.cpp Source File

Go to the documentation of this file.

Go to the SVN repository for this file.

47  if

(

NULL

!= v->parentEdge)

49  if

(

NULL

!= v->leftEdge)

51  if

(

NULL

!= v->rightEdge)

53  if

(

NULL

!= v->middleEdge)

80

newNode->

index

= index;

95

newEdge->

tail

= tail;

192

fprintf(stderr,

"Error: root %s is poorly rooted.\n"

,v->

label

);

meSet * addToSet(meNode *v, meSet *X)

meEdge * makeEdge(const char *label, meNode *tail, meNode *head, double weight)

meEdge * copyEdge(meEdge *e)

meNode * makeNewNode(const char *label, int i)

meEdge * siblingEdge(meEdge *e)

meNode * copyNode(meNode *v)

meNode * makeNode(const char *label, meEdge *parentEdge, int index)

void freeSubTree(meEdge *e)

meTree * detrifurcate(meTree *T)

void updateSizes(meEdge *e, int direction)

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define END_SCOPE(ns)

End the previously defined scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

#define BEGIN_SCOPE(ns)

Define a new scope.

static const char label[]

struct meEdge * rightEdge

struct meEdge * parentEdge

struct meEdge * middleEdge

struct meSet * secondNode

struct meNode * firstNode


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