raiigraph
C++ RAII for igraph data structures
|
This is the complete list of members for raiigraph::Graph, including all inherited members.
ecount() const | raiigraph::Graph | inline |
get() | raiigraph::Graph | inline |
get() const | raiigraph::Graph | inline |
get_edgelist(igraph_bool_t by_col=false) const | raiigraph::Graph | inline |
Graph(igraph_integer_t num_vertices=0, igraph_bool_t directed=false) | raiigraph::Graph | inline |
Graph(const IntVector &edges, igraph_integer_t num_vertices, igraph_bool_t directed) | raiigraph::Graph | inline |
Graph(const igraph_vector_int_t *edges, igraph_integer_t num_vertices, igraph_bool_t directed) | raiigraph::Graph | inline |
Graph(igraph_t &&graph) | raiigraph::Graph | inline |
Graph(const Graph &other) | raiigraph::Graph | inline |
Graph(Graph &&other) | raiigraph::Graph | inline |
has_loop() const | raiigraph::Graph | inline |
has_multiple() const | raiigraph::Graph | inline |
has_mutual(igraph_bool_t loops=false) const | raiigraph::Graph | inline |
is_acyclic() const | raiigraph::Graph | inline |
is_connected(igraph_connectedness_t mode=IGRAPH_WEAK) const | raiigraph::Graph | inline |
is_dag() const | raiigraph::Graph | inline |
is_directed() const | raiigraph::Graph | inline |
is_forest(igraph_neimode_t mode=IGRAPH_ALL) const | raiigraph::Graph | inline |
is_simple() const | raiigraph::Graph | inline |
is_tree(igraph_neimode_t mode=IGRAPH_ALL) const | raiigraph::Graph | inline |
operator const igraph_t *() const | raiigraph::Graph | inline |
operator igraph_t *() | raiigraph::Graph | inline |
operator=(const Graph &other) | raiigraph::Graph | inline |
operator=(Graph &&other) | raiigraph::Graph | inline |
vcount() const | raiigraph::Graph | inline |
~Graph() | raiigraph::Graph | inline |