Git-Mirrors/RetroShare
1
0
Fork 0
mirror of https://github.com/RetroShare/RetroShare.git synced 2025-06-20 20:34:25 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

significantly lowered the cost of the network graph by computing pairwise repulsive forces 8 times less often

Browse source 
git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@6195 b45a01b8-16f6-495d-af2f-9b41ad6348cc
This commit is contained in:
csoler 2013-03-07 20:16:04 +00:00
parent 23209c8c45
commit 29a762d340
1 changed files with 29 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

50
retroshare-gui/src/gui/elastic/graphwidget.cpp
View file

@ -219,7 +219,7 @@ void GraphWidget::itemMoved()
#ifdef DEBUG_ELASTIC #ifdef DEBUG_ELASTIC
std::cout << "starting timer" << std::endl; std::cout << "starting timer" << std::endl;
#endif #endif
timerId = startTimer(1000 / 25); timerId = startTimer(1000 / 25); // hit timer 25 times per second.
} }
} }
@ -307,36 +307,44 @@ void GraphWidget::timerEvent(QTimerEvent *event)
static const int S = 256 ; static const int S = 256 ;
static double *forceMap = new double[2*S*S] ; static double *forceMap = new double[2*S*S] ;
memset(forceMap,0,2*S*S*sizeof(double)) ; // Update force map only once every 8 hits.
//
static uint32_t hit = 0 ;
QRectF R(scene()->sceneRect()) ; QRectF R(scene()->sceneRect()) ;
foreach (Node *node, _nodes) if( (hit++ & 7) == 0)
{ {
QPointF pos = node->mapToScene(QPointF(0,0)) ; memset(forceMap,0,2*S*S*sizeof(double)) ;
float x = S*(pos.x()-R.left())/R.width() ; foreach (Node *node, _nodes)
float y = S*(pos.y()- R.top())/R.height() ;
int i=(int)floor(x) ;
int j=(int)floor(y) ;
float di = x-i ;
float dj = y-j ;
if( i>=0 && i<S-1 && j>=0 && j<S-1)
{ {
forceMap[2*(i +S*(j ))] += (1-di)*(1-dj) ; QPointF pos = node->mapToScene(QPointF(0,0)) ;
forceMap[2*(i+1+S*(j ))] += di *(1-dj) ;
forceMap[2*(i +S*(j+1))] += (1-di)*dj ; float x = S*(pos.x()-R.left())/R.width() ;
forceMap[2*(i+1+S*(j+1))] += di *dj ; float y = S*(pos.y()- R.top())/R.height() ;
int i=(int)floor(x) ;
int j=(int)floor(y) ;
float di = x-i ;
float dj = y-j ;
if( i>=0 && i<S-1 && j>=0 && j<S-1)
{
forceMap[2*(i +S*(j ))] += (1-di)*(1-dj) ;
forceMap[2*(i+1+S*(j ))] += di *(1-dj) ;
forceMap[2*(i +S*(j+1))] += (1-di)*dj ;
forceMap[2*(i+1+S*(j+1))] += di *dj ;
}
} }
// compute convolution with 1/omega kernel.
convolveWithGaussian(forceMap,S,20) ;
} }
// compute convolution with 1/omega kernel.
convolveWithGaussian(forceMap,S,20) ;
static float speedf=1.0f; static float speedf=1.0f;
foreach (Node *node, _nodes) foreach (Node *node, _nodes)
{ {
QPointF pos = node->mapToScene(QPointF(0,0)) ; QPointF pos = node->mapToScene(QPointF(0,0)) ;
float x = S*(pos.x()-R.left())/R.width() ; float x = S*(pos.x()-R.left())/R.width() ;