GraphCircleFinder

This class implements an algorithm for finding inner circles in a given graph, namely circles that do not contain other circles.

[ ligand_pharma | Source | Keywords | Summary | Ancestors | All Members | Descendants ]

Quick Index

KEYWORD

AUTHORS

CHANGES LOG

GOALS

USAGE

Class Summary

Back to the top of GraphCircleFinder

KEYWORD

Back to the top of GraphCircleFinder

AUTHORS

Copyright: SAMBA group, Tel-Aviv Univ. Israel, 2004.

Back to the top of GraphCircleFinder

CHANGES LOG

Back to the top of GraphCircleFinder

GOALS

Back to the top of GraphCircleFinder

USAGE

Back to the top of GraphCircleFinder

typedef vector< leda::node> NodeCircle;

A circle defined by the list of the nodes along it without repetition

  typedef vector< leda::node> NodeCircle;

Back to the top of GraphCircleFinder

typedef vector< leda::edge> EdgeCircle;

A circle defined by the list of the edges along it without repetition

  typedef vector< leda::edge> EdgeCircle;

Back to the top of GraphCircleFinder

const unsigned int UNLIMITED_CIRCLE_SIZE = 1000000000;

  const static unsigned int UNLIMITED_CIRCLE_SIZE = 1000000000;

Back to the top of GraphCircleFinder

const unsigned int INFINITE_DISTANCE = 1000000000;

  const static unsigned int INFINITE_DISTANCE = 1000000000;

Back to the top of GraphCircleFinder

GraphCircleFinder(const leda::graph& G_) ;

  GraphCircleFinder(const leda::graph& G_) ;

Function is currently defined inline.

Back to the top of GraphCircleFinder

void findCircles(unsigned int circleMaxNumOfEdges);

Find all the inner circles in the graph whose number of edges is at most circleMaxNumOfEdges.

  void findCircles(unsigned int circleMaxNumOfEdges);

Back to the top of GraphCircleFinder

unsigned int getNumOfCircles() const ;

  unsigned int getNumOfCircles() const                               
;

Function is currently defined inline.

Back to the top of GraphCircleFinder

const vector< NodeCircle>& getCircles() const ;

Returns all the inner circles found in the graph, where each circle is defined by the list of nodes along it without repetitaion (namely each node appears only once in this list)

  const vector< NodeCircle>& getCircles() const                              
;

Function is currently defined inline.

Back to the top of GraphCircleFinder

void getCircles(vector< EdgeCircle>& circles) const;

Returns all the inner circles found in the graph, where each circle is defined by the list of edges along it without repetitaion (namely each edge appears only once in this list).

  void getCircles(vector< EdgeCircle>& circles) const;

Back to the top of GraphCircleFinder

const NodeCircle& getCircle(unsigned int i) const ;

Given an index of a circle, the method returns the list of nodes of the desired circle without repetitaion (namely each node appears only once in this list)

  const NodeCircle& getCircle(unsigned int i) const                                 
;

Function is currently defined inline.

Back to the top of GraphCircleFinder

void getCircle(unsigned int i, EdgeCircle& edgeCircle) const;

Given an index of a circle, the method returns the list of edges of the desired circle without repetitaion (namely each edge appears only once in this list)

  void getCircle(unsigned int i, EdgeCircle& edgeCircle) const;

Back to the top of GraphCircleFinder

All Members

Back to the top of GraphCircleFinder

Ancestors

Back to the top of GraphCircleFinder

Descendants

Back to the top of GraphCircleFinder