1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
Description: Fix spelling
Author: Andreas Tille <tille@debian.org>
Last-Update: Fri, 13 Jul 2018 22:26:48 +0200
--- a/pdb2pka/substruct/Algorithms.cpp
+++ b/pdb2pka/substruct/Algorithms.cpp
@@ -74,7 +74,7 @@ public:
/*----------------------------------------------------------------------------*/
static char find_max_clique__doc__[] =
"This function takes a two-dimensional Numeric-array and \
-interpretes it as the adjacency matrix of a graph. It then \
+interprets it as the adjacency matrix of a graph. It then \
uses the algorithm of Bron and Kerbosch to detect maximal \
cliques in that graph and returns the nodes of a maximal clique. \
It is assumed that the nodes 0..n-1 are given in the order as they \
@@ -173,7 +173,7 @@ int collect_cliques(const _set *st, void
/*----------------------------------------------------------------------------*/
static char find_cliques__doc__[] =
"This function takes a two-dimensional Numeric-array and \
-interpretes it as the adjacency matrix of a graph. It then \
+interprets it as the adjacency matrix of a graph. It then \
uses the algorithm of Bron and Kerbosch to detect maximal \
cliques in that graph and returns a list of lists containing \
the nodes of all maximal cliques (up to 10000). It is assumed \
|
