havoqgt::mpi::triangle_count_visitor< Graph > Class Template Reference

#include <triangle_count.hpp>

Public Types
typedef triangle_count_visitor< Graph >	my_type
typedef Graph::vertex_locator	vertex_locator
typedef Graph::template vertex_data< uint64_t, std::allocator< uint64_t > >	vdtd_type

Public Member Functions
	triangle_count_visitor ()
	triangle_count_visitor (vertex_locator v)
	triangle_count_visitor (vertex_locator v, vertex_locator f, uint32_t deg)
	triangle_count_visitor (vertex_locator v, vertex_locator f, vertex_locator s, uint32_t deg)
bool	pre_visit () const
template<typename VisitorQueueHandle >
bool	visit (Graph &g, VisitorQueueHandle vis_queue) const
int	get_state () const

Static Public Member Functions
static void	set_tc_data (vdtd_type *_data)
static vdtd_type *&	tc_data ()

Public Attributes
vertex_locator	vertex
vertex_locator	first
vertex_locator	second
uint32_t	last_degree

Static Public Attributes
static Graph *	m_ptr_graph

Friends
bool	operator> (const triangle_count_visitor &v1, const triangle_count_visitor &v2)
bool	operator< (const triangle_count_visitor &v1, const triangle_count_visitor &v2)

Detailed Description

template<typename Graph>
class havoqgt::mpi::triangle_count_visitor< Graph >

Definition at line 106 of file triangle_count.hpp.

Member Typedef Documentation

template<typename Graph >

typedef triangle_count_visitor<Graph> havoqgt::mpi::triangle_count_visitor< Graph >::my_type

Definition at line 108 of file triangle_count.hpp.

template<typename Graph >

typedef Graph::template vertex_data<uint64_t, std::allocator<uint64_t> > havoqgt::mpi::triangle_count_visitor< Graph >::vdtd_type

Definition at line 182 of file triangle_count.hpp.

template<typename Graph >

typedef Graph::vertex_locator havoqgt::mpi::triangle_count_visitor< Graph >::vertex_locator

Definition at line 109 of file triangle_count.hpp.

Constructor & Destructor Documentation

template<typename Graph >

havoqgt::mpi::triangle_count_visitor< Graph >::triangle_count_visitor ( )

inline

Definition at line 111 of file triangle_count.hpp.

                          :
      vertex(),
      first(),
      second(),
      last_degree(0) { }

template<typename Graph >

havoqgt::mpi::triangle_count_visitor< Graph >::triangle_count_visitor ( vertex_locator  v )

inline

Definition at line 117 of file triangle_count.hpp.

                                          :
        vertex(v),
        first(),
        second(),
        last_degree(0) { }

template<typename Graph >

havoqgt::mpi::triangle_count_visitor< Graph >::triangle_count_visitor ( vertex_locator  v, vertex_locator  f, uint32_t  deg  )

inline

Definition at line 123 of file triangle_count.hpp.

                                                                          :
        vertex(v), first(f),
        second(),
        last_degree(deg) { }

template<typename Graph >

havoqgt::mpi::triangle_count_visitor< Graph >::triangle_count_visitor ( vertex_locator  v, vertex_locator  f, vertex_locator  s, uint32_t  deg  )

inline

Definition at line 128 of file triangle_count.hpp.

                                                                                            :
        vertex(v), first(f), second(s), last_degree(deg) { }

Member Function Documentation

template<typename Graph >

int havoqgt::mpi::triangle_count_visitor< Graph >::get_state ( ) const

inline

Definition at line 172 of file triangle_count.hpp.

                        {
    if(!first.is_valid()) {
      return 0;
    }
    if(!second.is_valid()) {
      return 1;
    }
    return 2;
  }

template<typename Graph >

bool havoqgt::mpi::triangle_count_visitor< Graph >::pre_visit ( ) const

inline

Definition at line 131 of file triangle_count.hpp.

                         {
    //return true;//(second == std::numeric_limits<vertex_descriptor_type>::max());
    uint32_t my_degree = m_ptr_graph->degree(vertex);
    if( last_degree < my_degree ) {
      return true;
    } else if( last_degree > my_degree) {
      return false;
    }
    return first < vertex;
  }

template<typename Graph >

static void havoqgt::mpi::triangle_count_visitor< Graph >::set_tc_data ( vdtd_type *  _data )

inlinestatic

Definition at line 184 of file triangle_count.hpp.

{ tc_data() = _data; }

Here is the call graph for this function:

template<typename Graph >

static vdtd_type*& havoqgt::mpi::triangle_count_visitor< Graph >::tc_data ( )

inlinestatic

Definition at line 186 of file triangle_count.hpp.

                               {
    static vdtd_type* data;
    return data;
  }

Here is the caller graph for this function:

template<typename Graph >

template<typename VisitorQueueHandle >

bool havoqgt::mpi::triangle_count_visitor< Graph >::visit ( Graph &  g, VisitorQueueHandle  vis_queue  ) const

inline

Definition at line 143 of file triangle_count.hpp.

                                                           {

    if(!first.is_valid()) {
      typedef typename Graph::edge_iterator eitr_type;
      for(eitr_type eitr = g.edges_begin(vertex); eitr != g.edges_end(vertex); ++eitr) {
        vertex_locator neighbor = eitr.target();
        my_type new_visitor( neighbor, vertex, g.degree(vertex) );
        vis_queue->queue_visitor(new_visitor);
      }
    } else if(!second.is_valid()) {
      typedef typename Graph::edge_iterator eitr_type;
      for(eitr_type eitr = g.edges_begin(vertex); eitr != g.edges_end(vertex); ++eitr) {
        vertex_locator neighbor = eitr.target();
        my_type new_visitor( neighbor, vertex, first, g.degree(vertex) );
        vis_queue->queue_visitor(new_visitor);
      }
    } else {
      //Make a binary search here!
      typedef typename Graph::edge_iterator eitr_type;
      for(eitr_type eitr = g.edges_begin(vertex); eitr != g.edges_end(vertex); ++eitr) {
        vertex_locator neighbor = eitr.target();
        if(neighbor == second) {
          (*tc_data())[vertex] = (*tc_data())[vertex] + 1;
        }
      }
    }
    return true;
  }

Here is the call graph for this function:

Friends And Related Function Documentation

template<typename Graph >

bool operator< ( const triangle_count_visitor< Graph > &  v1, const triangle_count_visitor< Graph > &  v2  )

friend

Definition at line 195 of file triangle_count.hpp.

                                                                                                   {
    return v1.get_state() > v2.get_state();
  }

template<typename Graph >

bool operator> ( const triangle_count_visitor< Graph > &  v1, const triangle_count_visitor< Graph > &  v2  )

friend

Definition at line 191 of file triangle_count.hpp.

                                                                                                   {
    return v1.get_state() < v2.get_state();
  }

Member Data Documentation

template<typename Graph >

vertex_locator havoqgt::mpi::triangle_count_visitor< Graph >::first

Definition at line 199 of file triangle_count.hpp.

template<typename Graph >

uint32_t havoqgt::mpi::triangle_count_visitor< Graph >::last_degree

Definition at line 200 of file triangle_count.hpp.

template<typename Graph >

Graph * havoqgt::mpi::triangle_count_visitor< Graph >::m_ptr_graph

static

Definition at line 201 of file triangle_count.hpp.

template<typename Graph >

vertex_locator havoqgt::mpi::triangle_count_visitor< Graph >::second

Definition at line 199 of file triangle_count.hpp.

template<typename Graph >

vertex_locator havoqgt::mpi::triangle_count_visitor< Graph >::vertex

Definition at line 199 of file triangle_count.hpp.

---

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

• include/havoqgt/triangle_count.hpp