All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | Protected Attributes | List of all members
NetworKit::DynamicGraphSource Class Referenceabstract

#include <DynamicGraphSource.h>

Public Member Functions

 DynamicGraphSource ()
 Default constructor. More...
 
virtual ~DynamicGraphSource ()=default
 
GraphEventProxynewGraph ()
 After constructing a DynamicGraphGenerator, call this to set a new a Graph and GraphEventProxy instance and get access to them. More...
 
virtual void initializeGraph ()=0
 The generator may expect the graph to be in a certain initial state. More...
 
virtual void generate ()=0
 Perform one generative step - as defined by the implementation. More...
 
virtual void generateWhile (std::function< bool(void)> cont)
 
virtual void generateNodes (count n)
 Continue generating until the number of nodes reaches this upper limit. More...
 
virtual void generateEdges (count m)
 Continue generating until the number of edges reaches this upper limit. More...
 
virtual void generateTimeSteps (count t)
 Continue generating until the number of time steps reaches this upper limit. More...
 

Protected Attributes

GraphEventProxyGproxy
 receives events produced by the generator and forwards them More...
 
GraphG
 
bool graphSet
 true if newGraph has been called and graph and proxy instances are properly set More...
 
bool graphInitialized
 true if initializeGraph has been called and graph has been properly initialized More...
 

Constructor & Destructor Documentation

NetworKit::DynamicGraphSource::DynamicGraphSource ( )

Default constructor.

virtual NetworKit::DynamicGraphSource::~DynamicGraphSource ( )
virtualdefault

Member Function Documentation

virtual void NetworKit::DynamicGraphSource::generate ( )
pure virtual

Perform one generative step - as defined by the implementation.

Implemented in NetworKit::DynamicDGSParser, and NetworKit::DynamicBarabasiAlbertGenerator.

void NetworKit::DynamicGraphSource::generateEdges ( count  m)
virtual

Continue generating until the number of edges reaches this upper limit.

Parameters
[in]mnumber of edges
void NetworKit::DynamicGraphSource::generateNodes ( count  n)
virtual

Continue generating until the number of nodes reaches this upper limit.

Parameters
[in]nnumber of nodes
void NetworKit::DynamicGraphSource::generateTimeSteps ( count  t)
virtual

Continue generating until the number of time steps reaches this upper limit.

void NetworKit::DynamicGraphSource::generateWhile ( std::function< bool(void)>  cont)
virtual
virtual void NetworKit::DynamicGraphSource::initializeGraph ( )
pure virtual

The generator may expect the graph to be in a certain initial state.

Call this method first.

Implemented in NetworKit::DynamicBarabasiAlbertGenerator, and NetworKit::DynamicDGSParser.

GraphEventProxy * NetworKit::DynamicGraphSource::newGraph ( )

After constructing a DynamicGraphGenerator, call this to set a new a Graph and GraphEventProxy instance and get access to them.

Member Data Documentation

Graph* NetworKit::DynamicGraphSource::G
protected
GraphEventProxy* NetworKit::DynamicGraphSource::Gproxy
protected

receives events produced by the generator and forwards them

bool NetworKit::DynamicGraphSource::graphInitialized
protected

true if initializeGraph has been called and graph has been properly initialized

bool NetworKit::DynamicGraphSource::graphSet
protected

true if newGraph has been called and graph and proxy instances are properly set


The documentation for this class was generated from the following files: