GDBMS 1.0
|
00001 class transaction_mode_commands_find{ 00008 public: 00010 00036 static int FindMinPathBetweenNodes(int transaction_USCOREid, std::string node_USCOREname1, std::string node_USCOREname2, std::string paths, int paths_USCOREcount, std::string path_USCOREedges, struct ns1__FindMinPathBetweenNodesResponse &_param_24); 00037 00039 00065 static int FindAllPathsBetweenNodes(int transaction_USCOREid, std::string node_USCOREname1, std::string node_USCOREname2, std::string paths, int paths_USCOREcount, std::string path_USCOREedges, struct ns1__FindMaxPathBetweenNodesResponse &_param_25); 00066 00068 00096 static int FindAllPathsBetweenNodes(int transaction_USCOREid, std::string node_USCOREname1, std::string node_USCOREname2, std::string paths, int paths_USCOREcount, std::string path_USCOREedges, struct ns1__FindAllPathsBetweenNodesResponse &_param_26); 00097 00099 00125 static int FindAllFriends(int transaction_USCOREid, std::string node_USCOREname, std::string paths_USCOREnodes, int paths_USCOREcount, struct ns1__FindAllFriendsResponse &_param_27); 00126 00128 static int FindBFS(int transaction_USCOREid, std::string node_USCOREname, std::string paths_USCOREnodes, std::string paths_USCOREvalues, int paths_USCOREcount, int limit_USCOREnodes, struct ns1__FindBFSResponse &_param_28); 00129 00131 static int FindDFS(int transaction_USCOREid, std::string node_USCOREname, std::string paths_USCOREnodes, std::string paths_USCOREvalues, int paths_USCOREcount, int limit_USCOREnodes, struct ns1__FindDFSResponse &_param_29); 00132 /*ako tablicata e syzdadena ne q syzdava nanovo*/ 00134 static void dijkstraMin(int s, char *T, unsigned*d, int *pred, string& path_edges, tr_twin_ht& nodtwin1, tr_twin_ht& edgtwin1); 00136 static void dijkstraMax(int s, char *T, unsigned*d, int *pred, string& path_edges, tr_twin_ht& nodtwin1, tr_twin_ht& edgtwin1); 00137 /*ako tablicata e syzdadena ne q syzdava nanovo*/ 00139 00147 static void dijkstraGetXMLResult(int s, string& result, string& paths, string & path_edges, char* T, unsigned int* d, int* pred, int endnodeid, tr_twin_ht& nodtwin1); 00149 static void getNeighborNodes(int node_id, listi& result, listi& metrics_edges, tr_twin_ht& nodtwin1, tr_twin_ht& edgtwin1, string& path_edges_1); 00151 00152 static void DFS(unsigned int i, char* used, listi& paths_nodes_l, listi& paths_values_l, std::string& response, tr_twin_ht& nodtwin1, tr_twin_ht& edgtwin1, int limit_nodes, int countvar); 00154 static void printDFS(unsigned i, char * used, listi& paths_nodes_l, listi& paths_values_l, string &response, tr_twin_ht& nodtwin1, tr_twin_ht& edgtwin1); 00155 };