carefree_internal::graph类 参考

#include <carefree.hpp>

类
struct	edge
struct	unweighted_output
struct	weighted_output

Public 成员函数
	graph (int N, bool directed=false, bool enable_edge_map=true)
void	add (edge edg, bool __add_vector=true)
void	add (int from, int to, _Weight weight=0)
bool	has_edge (edge edg)
bool	has_edge (int from, int to)
std::vector< edge >	get_edges ()
std::vector< edge >	get_edges (int from)
template<class T = weighted_output>
string	to_string (bool shuffle=false)

Public 属性
int	N
bool	directed
bool	enable_edge_map

构造及析构函数说明

graph()

carefree_internal::graph::graph ( int N, bool directed = false, bool enable_edge_map = true )

inline

函数调用图:

成员函数说明

add() [1/2]

void carefree_internal::graph::add ( edge edg, bool __add_vector = true )

inline

函数调用图:

这是这个函数的调用关系图:

add() [2/2]

void carefree_internal::graph::add ( int from, int to, _Weight weight = 0 )

inline

get_edges() [1/2]

std::vector< edge > carefree_internal::graph::get_edges ( )

inline

这是这个函数的调用关系图:

get_edges() [2/2]

std::vector< edge > carefree_internal::graph::get_edges ( int from )

inline

函数调用图:

has_edge() [1/2]

bool carefree_internal::graph::has_edge ( edge edg )

inline

这是这个函数的调用关系图:

has_edge() [2/2]

bool carefree_internal::graph::has_edge ( int from, int to )

inline

to_string()

template<class T = weighted_output>

string carefree_internal::graph::to_string ( bool shuffle = false )

inline

这是这个函数的调用关系图:

类成员变量说明

directed

bool carefree_internal::graph::directed

enable_edge_map

bool carefree_internal::graph::enable_edge_map

N

int carefree_internal::graph::N

---

该类的文档由以下文件生成:

• carefree.hpp