-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathmemoryDFS.h
53 lines (41 loc) · 1.58 KB
/
memoryDFS.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/* RNAStructProfiling -- Profiles RNA structures and produces a summary graph in graphviz format.
* Copyright 2013, 2014, 2018 Emily Rogers
*
* This file is part of RNAStructProfiling.
*
* RNAStructProfiling is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* RNAStructProfiling is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with RNAStructProfiling. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef MEMORYDFS_H
#define MEMORYDFS_H
#include "graph.h"
#include "hashtbl.h"
HASHTBL* MemoryDFS(node* root);
void MDFSHelper(node* root, node* v);
/* Returns 1 if the node was found, 0 otherwise */
int inCurrentPath(node* n);
/* Looks for edge between root and v
if remove is 1, removes edge.
Returns 1 if edge was removed, 0 otherwise */
int findEdge(node* root, node* v, int remove);
/* Adds node n to current path */
void addToPath(node* n);
/* Removes node n from current path */
void removeFromPath(node* n);
/* Prints the current path */
void printCurrentPath();
/* Prints neighbors of node n */
void printNeighbors(node* n);
extern node** currentPath;
extern int position;
#endif