Subgraphs.h File Reference

functionality for finding subgraphs and paths in molecules More...

#include <vector>
#include <list>
#include <map>

Go to the source code of this file.

Namespaces
namespace	RDKit
Typedefs
typedef std::vector< int >	RDKit::PATH_TYPE
typedef std::list< PATH_TYPE >	RDKit::PATH_LIST
typedef PATH_LIST::const_iterator	RDKit::PATH_LIST_CI
typedef std::map< int, PATH_LIST >	RDKit::INT_PATH_LIST_MAP
typedef INT_PATH_LIST_MAP::const_iterator	RDKit::INT_PATH_LIST_MAP_CI
typedef INT_PATH_LIST_MAP::iterator	RDKit::INT_PATH_LIST_MAP_I
Functions
INT_PATH_LIST_MAP	RDKit::findAllSubgraphsOfLengthsMtoN (const ROMol &mol, unsigned int lowerLen, unsigned int upperLen, bool useHs=false)
	find all subgraphs in a range of sizes
PATH_LIST	RDKit::findAllSubgraphsOfLengthN (const ROMol &mol, unsigned int targetLen, bool useHs=false)
	find all subgraphs of a particular size
PATH_LIST	RDKit::findUniqueSubgraphsOfLengthN (const ROMol &mol, unsigned int targetLen, bool useHs=false, bool useBO=true)
	find unique subgraphs of a particular size
PATH_LIST	RDKit::findAllPathsOfLengthN (const ROMol &mol, unsigned int targetLen, bool useBonds=true, bool useHs=false)
	find all paths of a particular size

---

Detailed Description

functionality for finding subgraphs and paths in molecules

Difference between _subgraphs_ and _paths_ : Subgraphs are potentially branched, whereas paths (in our terminology at least) cannot be. So, the following graph:

            C--0--C--1--C--3--C
                  |
                  2
                  |
                  C

has 3 _subgraphs_ of length 3: (0,1,2),(0,1,3),(2,1,3) but only 2 _paths_ of length 3: (0,1,3),(2,1,3)

Definition in file Subgraphs.h.