NPL
Neurological Programs and Libraries
|
#include <graph.h>
Public Member Functions | |
Graph () | |
Graph (std::string filename, bool typefail=true) | |
Graph (size_t nodes) | |
Graph (Graph &&other) | |
Graph (const Graph &other) | |
Graph (size_t nodes, void *data, std::function< void(void *)> deleter=[](void *){}) | |
~Graph () | |
void | init (size_t nodes) |
void | init (size_t nodes, void *data, std::function< void(void *)> deleter=[](void *){}) |
Graph & | operator= (Graph< T > &&other) |
T & | operator() (size_t from, size_t to) |
const T & | operator() (size_t from, size_t to) const |
size_t | nodes () const |
const std::string & | name (size_t ii) const |
std::string & | name (size_t ii) |
void | load (std::string filename, bool typefail=true) |
void | save (std::string filename, GraphStoreT store=G_STORE_FULLMAT) |
void | normalize () |
double | assortativity () const |
double | assortativity_wei () const |
T | strength () const |
std::vector< T > | strengths () const |
std::vector< T > | strengths (std::vector< T > &is, std::vector< T > &os) const |
int | degree () const |
std::vector< int > | degrees () const |
std::vector< int > | degrees (std::vector< int > &is, std::vector< int > &os) const |
std::vector< int > | betweenness_centrality () const |
std::vector< int > | betweenness_centrality_next () const |
void | shortest (Graph< T > &sdist) const |
void | shortest (Graph< int > &next, Graph< T > &sdist) const |
Static Public Member Functions | |
static GraphDataT | type () |
static std::string | typestr () |
static Graph< T > | Coxeter () |
static Graph< T > | PreRandom () |
npl::Graph< T >::Graph | ( | ) |
npl::Graph< T >::Graph | ( | std::string | filename, |
bool | typefail = true |
||
) |
npl::Graph< T >::Graph | ( | size_t | nodes | ) |
npl::Graph< T >::Graph | ( | Graph< T > && | other | ) |
npl::Graph< T >::Graph | ( | const Graph< T > & | other | ) |
npl::Graph< T >::Graph | ( | size_t | nodes, |
void * | data, | ||
std::function< void(void *)> | deleter = [](void *){} |
||
) |
|
inline |
double npl::Graph< T >::assortativity | ( | ) | const |
double npl::Graph< T >::assortativity_wei | ( | ) | const |
std::vector<int> npl::Graph< T >::betweenness_centrality | ( | ) | const |
std::vector<int> npl::Graph< T >::betweenness_centrality_next | ( | ) | const |
|
static |
int npl::Graph< T >::degree | ( | ) | const |
std::vector<int> npl::Graph< T >::degrees | ( | ) | const |
std::vector<int> npl::Graph< T >::degrees | ( | std::vector< int > & | is, |
std::vector< int > & | os | ||
) | const |
void npl::Graph< T >::init | ( | size_t | nodes | ) |
void npl::Graph< T >::init | ( | size_t | nodes, |
void * | data, | ||
std::function< void(void *)> | deleter = [](void *){} |
||
) |
void npl::Graph< T >::load | ( | std::string | filename, |
bool | typefail = true |
||
) |
|
inline |
|
inline |
|
inline |
void npl::Graph< T >::normalize | ( | ) |
|
inline |
|
inline |
Graph& npl::Graph< T >::operator= | ( | Graph< T > && | other | ) |
|
static |
void npl::Graph< T >::save | ( | std::string | filename, |
GraphStoreT | store = G_STORE_FULLMAT |
||
) |
void npl::Graph< T >::shortest | ( | Graph< T > & | sdist | ) | const |
void npl::Graph< T >::shortest | ( | Graph< int > & | next, |
Graph< T > & | sdist | ||
) | const |
T npl::Graph< T >::strength | ( | ) | const |
std::vector<T> npl::Graph< T >::strengths | ( | ) | const |
std::vector<T> npl::Graph< T >::strengths | ( | std::vector< T > & | is, |
std::vector< T > & | os | ||
) | const |
|
inlinestatic |
|
inlinestatic |