alglib::graph::models::adj_matrix< vertex_t, edge_t > Class Template Reference

#include <adj_matrix.h>

Inheritance diagram for alglib::graph::models::adj_matrix< vertex_t, edge_t >:

Public Types
typedef vertex_t	vertex_type
typedef edge_t	edge_type
typedef alglib::bimap::bimap< vertex_t, int >::type1_iterator	const_viterator

Public Member Functions
	adj_matrix ()=default
void	add_vertex (const vertex_t &u)
void	remove_vertex ()
int	indeg (const vertex_t &u) const
int	outdeg (const vertex_t &u) const
int	num_vertices () const
int	num_edges () const
const_viterator	vbegin () const
const_viterator	vend () const
Public Member Functions inherited from alglib::graph::models::graph_model< vertex_t, edge_t >
virtual bool	are_adj (const vertex_t &, const vertex_t &) const =0
	Returs true if the two given vertices are adjacent, false otherwise. More...
virtual void	add_edge (const vertex_t &u, const vertex_t &v, const edge_t &a)=0
virtual void	add_edge (const edge_t &a)=0
virtual void	remove_vertex (const vertex_t &v)=0
virtual void	remove_edge (const vertex_t &u, const vertex_t &v)=0

Member Typedef Documentation

template<typename vertex_t , typename edge_t >

typedef alglib::bimap::bimap<vertex_t, int>::type1_iterator alglib::graph::models::adj_matrix< vertex_t, edge_t >::const_viterator

template<typename vertex_t , typename edge_t >

typedef edge_t alglib::graph::models::adj_matrix< vertex_t, edge_t >::edge_type

template<typename vertex_t , typename edge_t >

typedef vertex_t alglib::graph::models::adj_matrix< vertex_t, edge_t >::vertex_type

Constructor & Destructor Documentation

template<typename vertex_t , typename edge_t >

alglib::graph::models::adj_matrix< vertex_t, edge_t >::adj_matrix ( )

default

Member Function Documentation

template<typename vertex_t , typename edge_t >

void alglib::graph::models::adj_matrix< vertex_t, edge_t >::add_vertex ( const vertex_t &  u )

inlinevirtual

Implements alglib::graph::models::graph_model< vertex_t, edge_t >.

                                       {
        vertex_to_int.insert(u, vsize++);
        grow_matrix(vsize);
    }

template<typename vertex_t , typename edge_t >

int alglib::graph::models::adj_matrix< vertex_t, edge_t >::indeg ( const vertex_t &  u ) const

inlinevirtual

Implements alglib::graph::models::graph_model< vertex_t, edge_t >.

                                       {
        return indeg_rec[vertex_to_int.get_image(u)];
    }

template<typename vertex_t , typename edge_t >

int alglib::graph::models::adj_matrix< vertex_t, edge_t >::num_edges ( ) const

inlinevirtual

Implements alglib::graph::models::graph_model< vertex_t, edge_t >.

                          {

    }

template<typename vertex_t , typename edge_t >

int alglib::graph::models::adj_matrix< vertex_t, edge_t >::num_vertices ( ) const

inlinevirtual

Implements alglib::graph::models::graph_model< vertex_t, edge_t >.

                             {
        return vertex_to_int.size();
    }

template<typename vertex_t , typename edge_t >

int alglib::graph::models::adj_matrix< vertex_t, edge_t >::outdeg ( const vertex_t &  u ) const

inlinevirtual

Implements alglib::graph::models::graph_model< vertex_t, edge_t >.

                                        {
        return indeg_rec[vertex_to_int.get_image(u)];
    }

template<typename vertex_t , typename edge_t >

void alglib::graph::models::adj_matrix< vertex_t, edge_t >::remove_vertex ( )

inline

{}

template<typename vertex_t , typename edge_t >

const_viterator alglib::graph::models::adj_matrix< vertex_t, edge_t >::vbegin ( ) const

inline

                                   {
        vertex_to_int.domain_begin();
    }

template<typename vertex_t , typename edge_t >

const_viterator alglib::graph::models::adj_matrix< vertex_t, edge_t >::vend ( ) const

inline

                                 {
        return vertex_to_int.domain_end();
    }

---

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

• alglib/graph/models/adj_matrix.h