#include <ncbi_pch.hpp>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "fastme.h"
#include "graph.h"
Go to the source code of this file.
Go to the SVN repository for this file.
◆ compareSets() void compareSets ( meTree * T, meSet * S, FILE * ofile )Definition at line 48 of file inputs.cpp.
References depthFirstTraverse(), exit(), EXIT_FAILURE, meSet::firstNode, meEdge::head, meNode::index2, meNode::label, leaf(), NULL, meSet::secondNode, util::strcmp(), and T.
◆ depthFirstTraverse() ◆ freeMatrix() void freeMatrix ( double ** D, int size ) ◆ leaf() ◆ loadMatrix() double** loadMatrix ( double ** table_in, char ** labels, int * size_in, meSet * S ) ◆ loadMatrixOLD() double** loadMatrixOLD ( FILE * ifile, int * size, meSet * S )Definition at line 157 of file inputs.cpp.
References addToSet(), exit(), EXIT_FAILURE, i, meNode::index2, makeNewNode(), malloc(), MAX_EVENT_NAME, MAXSIZE, ncbi::grid::netcache::search::fields::size, and table.
◆ partitionSizes() void partitionSizes ( meTree * T )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