File: FeatTree.cpp

package info (click to toggle)
rdkit 201203-3
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 37,840 kB
  • sloc: cpp: 93,902; python: 51,897; java: 5,192; ansic: 3,497; xml: 2,499; sql: 1,641; yacc: 1,518; lex: 1,076; makefile: 325; fortran: 183; sh: 153; cs: 51
file content (84 lines) | stat: -rw-r--r-- 2,701 bytes parent folder | download
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// $Id: FeatTree.cpp 1528 2010-09-26 17:04:37Z glandrum $
//
//  Copyright (C) 2005-2006 Rational Discovery LLC
//
//   @@ All Rights Reserved @@
//  This file is part of the RDKit.
//  The contents are covered by the terms of the BSD license
//  which is included in the file license.txt, found at the root
//  of the RDKit source tree.
//
#include <RDGeneral/Invariant.h>
#include <RDGeneral/RDLog.h>
#include <GraphMol/RDKitBase.h>
#include "FeatTreeUtils.h"
#include "FeatTree.h"
#include <vector>
#include <algorithm>
#include <boost/graph/graph_utility.hpp>

namespace RDKit {
  namespace FeatTrees {
    typedef boost::property_map<FeatTreeGraph,FeatTreeEdge_t>::type FeatTreeEdgePMap;

    FeatTreeGraphSPtr molToBaseTree(const ROMol &mol){
      FeatTreeGraphSPtr resGraph(new FeatTreeGraph());


      // EFF: This can almost certainly be done with a single pass through
      // the atoms and rings, for now we're just trying to get it right

      // ------ ------ ------ ------
      // add a node to the initial feature tree for each of the SSSR rings:
      // ------ ------ ------ ------
      addRingsAndConnectors(mol,*resGraph);
      

      // ------ ------ ------ ------
      // Reduce any fused ring systems that form cycles in
      // the FeatTree to single points:
      // ------ ------ ------ ------
      replaceCycles(*resGraph);


      // ------ ------ ------ ------
      // We have not yet added bonds between ring systems, like
      // the N-N bond in:
      //    C1CN1-N1CC1
      // So loop over the rings that we currently have and add
      // those bonds as appropriate:
      // ------ ------ ------ ------
      addRingRingBonds(mol,*resGraph);
      
      // ------ ------ ------ ------
      // Now go through the molecule and add every non-ring atom that
      // has more than one neighbor; we include Hs in the neighbor count
      // ------ ------ ------ ------
      std::vector<unsigned int> atomIndices;
      atomIndices=addNonringAtoms(mol,*resGraph);

      // ------ ------ ------ ------
      // At this point all atom and ring nodes have been added to
      // the graph.
      // Add the atom-atom and atom-ring edges:
      // ------ ------ ------ ------
      addBondsFromNonringAtoms(mol,*resGraph,atomIndices);

      // ------ ------ ------ ------
      // Go through the graph and add zero nodes
      //  (points not associated with atoms that are used to
      //  break cycles caused by non-ring atoms bonding to rings)
      // ------ ------ ------ ------
      addZeroNodes(*resGraph);
      
      return resGraph;
    }

    void baseTreeToFeatTree(FeatTreeGraph &baseTree) {

    }

    
  } // end of namespace FeatTrees

}