static void destroyPaths()
{
PassageMarkerI marker;
while (slowPath != NULL_IDX) {
marker = slowPath;
slowPath = getNextInSequence(marker);
destroyPassageMarker(marker);
}
while (fastPath != NULL_IDX) {
marker = fastPath;
fastPath = getNextInSequence(marker);
destroyPassageMarker(marker);
}
}
static void trimLongReadTips()
{
IDnum index;
Node *node;
PassageMarkerI marker, next;
velvetLog("Trimming read tips\n");
for (index = 1; index <= nodeCount(graph); index++) {
node = getNodeInGraph(graph, index);
if (getUniqueness(node))
continue;
for (marker = getMarker(node); marker != NULL_IDX;
marker = next) {
next = getNextInNode(marker);
if (!isInitial(marker) && !isTerminal(marker))
continue;
if (isTerminal(marker))
marker = getTwinMarker(marker);
while (!getUniqueness(getNode(marker))) {
if (next != NULL_IDX
&& (marker == next
|| marker == getTwinMarker(next)))
next = getNextInNode(next);
if (getNextInSequence(marker) != NULL_IDX) {
marker = getNextInSequence(marker);
destroyPassageMarker
(getPreviousInSequence
(marker));
} else {
destroyPassageMarker(marker);
break;
}
}
}
}
}
static void destroyPaths()
{
PassageMarker *marker;
while (slowPath != NULL) {
marker = slowPath;
getNodeTime(getNode(marker));
getNodeTime(getTwinNode(getNode(marker)));
slowPath = getNextInSequence(marker);
destroyPassageMarker(marker);
}
while (fastPath != NULL) {
marker = fastPath;
getNodeTime(getNode(marker));
getNodeTime(getTwinNode(getNode(marker)));
fastPath = getNextInSequence(marker);
destroyPassageMarker(marker);
}
}
static void updateMembers(Node * bypass, Node * nextNode)
{
PassageMarkerI marker, next, tmp;
Coordinate nextLength = getNodeLength(nextNode);
// Update marker + arc info
for (marker = getMarker(bypass); marker != NULL_IDX; marker = tmp) {
tmp = getNextInNode(marker);
if (!isTerminal(marker)
&& getNode(getNextInSequence(marker)) == nextNode) {
// Marker steps right into target
next = getNextInSequence(marker);
disconnectNextPassageMarker(marker, graph);
destroyPassageMarker(next);
} else if (getUniqueness(nextNode)
&& goesToNode(marker, nextNode)) {
// Marker goes indirectly to target
while (getNode(getNextInSequence(marker)) !=
nextNode) {
next = getNextInSequence(marker);
disconnectNextPassageMarker(marker, graph);
destroyPassageMarker(next);
}
next = getNextInSequence(marker);
disconnectNextPassageMarker(marker, graph);
destroyPassageMarker(next);
} else if (!isTerminal(marker)
&& getFinishOffset(marker) == 0) {
// Marker goes somewhere else than to target
next = getNextInSequence(marker);
incrementFinishOffset(marker, nextLength);
} else {
// Marker goes nowhere
incrementFinishOffset(marker, nextLength);
}
}
}
static void reconnectPassageMarker(PassageMarkerI marker, Node * node,
PassageMarkerI * ptr)
{
PassageMarkerI current;
PassageMarkerI next = getNextInSequence(marker);
PassageMarkerI tmpMarker;
for (current = marker; getNode(current) != node;
current = getPreviousInSequence(current));
setPreviousInSequence(current, next);
concatenatePassageMarkers(current, marker);
// Removing node and all intermediaries
while (marker != current) {
tmpMarker = getPreviousInSequence(marker);
if (*ptr == marker || *ptr == getTwinMarker(marker))
*ptr = getNextInNode(*ptr);
setNextInSequence(marker, NULL_IDX);
setPreviousInSequence(NULL_IDX, marker);
destroyPassageMarker(marker);
marker = tmpMarker;
}
}
static Node *bypass()
{
Node *bypass = getNode(path);
Node *next = NULL;
Arc *arc;
PassageMarkerI nextMarker;
// Remove unwanted arcs
while (getArc(bypass) != NULL)
destroyArc(getArc(bypass), graph);
// Update extensive variables (length + descriptors + passage markers)
while (!isTerminal(path)) {
nextMarker = getNextInSequence(path);
next = getNode(nextMarker);
while (next == bypass) {
disconnectNextPassageMarker(path, graph);
destroyPassageMarker(nextMarker);
nextMarker = getNextInSequence(path);
next = getNode(nextMarker);
}
if (next == NULL)
return bypass;
// Overall node update
if (!getUniqueness(next)) {
adjustShortReads(bypass, getNextInSequence(path));
appendSequence(bypass, sequences,
getNextInSequence(path), graph);
} else {
concatenateReadStarts(bypass, next, graph);
#ifndef SINGLE_COV_CAT
Category cat;
for (cat = 0; cat < CATEGORIES; cat++) {
// Update virtual coverage
incrementVirtualCoverage(bypass, cat,
getVirtualCoverage(next, cat));
// Update original virtual coverage
incrementOriginalVirtualCoverage(bypass, cat,
getOriginalVirtualCoverage(next, cat));
}
#else
incrementVirtualCoverage(bypass, getVirtualCoverage(next));
#endif
appendDescriptors(bypass, next);
}
// Members
updateMembers(bypass, next);
// Termination
if (isTerminal(path) || getUniqueness(next))
break;
}
// Remove unique groupies from arrival
admitGroupies(next, bypass);
// Copy destination arcs
for (arc = getArc(next); arc != NULL; arc = getNextArc(arc)) {
if (getDestination(arc) == next)
continue;
else if (getDestination(arc) == getTwinNode(next))
createAnalogousArc(bypass, getTwinNode(bypass),
arc, graph);
else
createAnalogousArc(bypass, getDestination(arc),
arc, graph);
}
destroyNode(next, graph);
return bypass;
}