Maximum Acyclic Subgraph - Multiple Sequence Alignment
MaximumAcyclicSubgraph
Node.h
1 #pragma once
2 #include<string>
3 #include "Node.h"
4 #include<vector>
5 using std::string;
6 using std::vector;
7 
8 class Node {
9  public:
10 
11  bool operator ==(const Node& a);
12 
13  Node();
14 
15  // constructor: i sequence, j node in i, string of node
16  Node(unsigned int i, unsigned int j, string kmer);
17 
18  unsigned int i;
19  unsigned int j;
20  string kmer;
21 
22  vector<Node*> adjNodes;
23 };
24 
Definition: Node.h:8
unsigned int i
the index of the row/sequence
Definition: Node.h:18
vector< Node * > adjNodes
the nodes that match with this node in the following sequence
Definition: Node.h:22
string kmer
the string of the node
Definition: Node.h:20
bool operator==(const Node &a)
operator "==" to compare the indices of two Nodes
Definition: Node.cc:17
unsigned int j
the index of the node
Definition: Node.h:19