Connectivity.cpp File Reference

#include <iostream>
#include <vector>
#include <algorithm>

Go to the source code of this file.

Data Structures
struct	tab3_t
struct	edge_t

Macros
#define	_FCALL

Typedefs
typedef vector< edge_t >	edge_list_t
typedef vector< int >	tab1_t

Functions
void	edge_sort_ (edge_list_t **, int *, int *, int *, int *)
void	edge_get_nb_connect_ (edge_list_t **, int *)
void	edge_get_connect_ (edge_list_t **, int *)
void	edge_free_memory_ (edge_list_t **)
void	tab1_init_ (tab1_t **)
void	tab1_append_ (tab1_t **, int *)
void	tab1_append_tab_ (tab1_t **, int *, int *)
void	tab1_get_size_ (tab1_t **, int *)
void	tab1_get_ (tab1_t **, int *)
void	tab1_free_memory_ (tab1_t **)
void _FCALL	EDGE_SORT (edge_list_t **edge_ptr, int *n1, int *n2, int *elem, int *nedge)
void _FCALL	EDGE_GET_NB_CONNECT (edge_list_t **edge_ptr, int *nb_conn)
void _FCALL	EDGE_GET_CONNECT (edge_list_t **edge_ptr, int *elem)
void _FCALL	EDGE_FREE_MEMORY (edge_list_t **edge_ptr)
void _FCALL	TAB1_INIT (tab1_t **tab1_ptr)
void _FCALL	TAB1_APPEND (tab1_t **tab1_ptr, int *ii)
void _FCALL	TAB1_APPEND_TAB (tab1_t **tab1_ptr, int *n, int *tab)
void _FCALL	TAB1_GET_SIZE (tab1_t **tab1_ptr, int *ii)
void _FCALL	TAB1_GET (tab1_t **tab1_ptr, int *ii)
void _FCALL	TAB1_FREE_MEMORY (tab1_t **tab1_ptr, int *ii)

Macro Definition Documentation

_FCALL

#define _FCALL

Definition at line 27 of file Connectivity.cpp.

Typedef Documentation

edge_list_t

typedef vector<edge_t> edge_list_t

Definition at line 47 of file Connectivity.cpp.

tab1_t

typedef vector<int> tab1_t

Definition at line 48 of file Connectivity.cpp.

Function Documentation

EDGE_FREE_MEMORY()

void _FCALL EDGE_FREE_MEMORY

(

edge_list_t **

edge_ptr

)

Definition at line 71 of file Connectivity.cpp.

                                                       {
    edge_free_memory_(edge_ptr);
  }

edge_free_memory_()

void edge_free_memory_

(

edge_list_t **

edge_ptr

)

Definition at line 166 of file Connectivity.cpp.

{
  if (*edge_ptr != nullptr) {
    delete (*edge_ptr);
    *edge_ptr = nullptr;
  } 
}

EDGE_GET_CONNECT()

void _FCALL EDGE_GET_CONNECT	(	edge_list_t **	edge_ptr,
		int *	elem )

Definition at line 68 of file Connectivity.cpp.

                                                                  {
    edge_get_connect_(edge_ptr, elem);
  }

edge_get_connect_()

void edge_get_connect_	(	edge_list_t **	edge_ptr,
		int *	elem )

Definition at line 153 of file Connectivity.cpp.

{
  edge_list_t const * edge_list = *edge_ptr;
  int nn = edge_list->size();
  int cpt = 0;
  for (int i(0) ; i < nn ; ++i) {
    for (int j(0) ; j < edge_list->at(i).elem_list.size(); ++j) {
      elem[cpt] = edge_list->at(i).elem_list.at(j);
      cpt++;
    }
  }
}

EDGE_GET_NB_CONNECT()

void _FCALL EDGE_GET_NB_CONNECT	(	edge_list_t **	edge_ptr,
		int *	nb_conn )

Definition at line 65 of file Connectivity.cpp.

                                                                        {
    edge_get_nb_connect_(edge_ptr, nb_conn);
  }

edge_get_nb_connect_()

void edge_get_nb_connect_	(	edge_list_t **	edge_ptr,
		int *	nb_conn )

Definition at line 144 of file Connectivity.cpp.

{
  edge_list_t const * edge_list = *edge_ptr;
  int nn = edge_list->size();
  for (int i(0) ; i < nn ; ++i) {
    nb_conn[i] = edge_list->at(i).nb_con;
  }
}

EDGE_SORT()

void _FCALL EDGE_SORT	(	edge_list_t **	edge_ptr,
		int *	n1,
		int *	n2,
		int *	elem,
		int *	nedge )

Definition at line 62 of file Connectivity.cpp.

                                                                                         {
    edge_sort_(edge_ptr, n1, n2, elem, nedge);
  }

edge_sort_()

void edge_sort_	(	edge_list_t **	edge_ptr,
		int *	n1,
		int *	n2,
		int *	elem,
		int *	nedge )

Definition at line 95 of file Connectivity.cpp.

{
  int nn = *nedge;
  std::vector<tab3_t> tab(nn);
  for (int i(0) ; i < nn ; ++i) {
    tab.at(i).n1 = n1[i];
    tab.at(i).n2 = n2[i];
    tab.at(i).n3 = elem[i];
  }
  std::sort(tab.begin(), tab.end(), [] (tab3_t ielem1, tab3_t ielem2) 
        {return (ielem1.n1 < ielem2.n1);});
  int i = 0;
  while (i < tab.size()) {
    int j = i;
    for ( ; (j < tab.size()) && (tab.at(i).n1 == tab.at(j).n1) ; j++) {}
    if (j != i) {
      std::vector<tab3_t>::iterator iter1 = tab.begin() + i;
      std::vector<tab3_t>::iterator iter2 = tab.begin() + j;
      std::sort(iter1, iter2, [] (tab3_t ielem1, tab3_t ielem2) {return (ielem1.n2 < ielem2.n2);});
      i = j;
    }
  }
 
  
  *edge_ptr = new edge_list_t;
  edge_list_t* edge_list = *edge_ptr;
 
  edge_list->push_back(edge_t(tab.at(0).n1, tab.at(0).n2, tab.at(0).n3));
  for (int i(1) ; i < nn ; ++i) {
    if (tab.at(i).n1 != (*(edge_list->end()-1)).n1 ||  tab.at(i).n2 != (*(edge_list->end()-1)).n2) {
      edge_list->push_back(edge_t(tab.at(i).n1, tab.at(i).n2, tab.at(i).n3));
    } else {
      (*(edge_list->end()-1)).elem_list.push_back(tab.at(i).n3);
    }
  }
 
  for (int i(0) ; i < edge_list->size() ; ++i) {
    edge_list->at(i).nb_con = edge_list->at(i).elem_list.size();
  }
  
  *nedge = edge_list->size();
  nn = *nedge;
  // Copy back
  for (int i(0) ; i < nn ; ++i) {
    n1[i] = edge_list->at(i).n1;
    n2[i] = edge_list->at(i).n2;
  }
}

TAB1_APPEND()

void _FCALL TAB1_APPEND	(	tab1_t **	tab1_ptr,
		int *	ii )

Definition at line 77 of file Connectivity.cpp.

                                                      {
    tab1_append_(tab1_ptr, ii);
  }

tab1_append_()

void tab1_append_	(	tab1_t **	tab_ptr,
		int *	ii )

Definition at line 178 of file Connectivity.cpp.

{
  (*tab_ptr)->push_back(*ii);
}

TAB1_APPEND_TAB()

void _FCALL TAB1_APPEND_TAB	(	tab1_t **	tab1_ptr,
		int *	n,
		int *	tab )

Definition at line 80 of file Connectivity.cpp.

                                                                   {
    tab1_append_tab_(tab1_ptr, n, tab);
  }

tab1_append_tab_()

void tab1_append_tab_	(	tab1_t **	tab_ptr,
		int *	n,
		int *	tab )

Definition at line 182 of file Connectivity.cpp.

{
  for (int i(0) ; i < *n ; ++i) {
    (*tab_ptr)->push_back(tab[i]);
  }
}

TAB1_FREE_MEMORY()

void _FCALL TAB1_FREE_MEMORY	(	tab1_t **	tab1_ptr,
		int *	ii )

Definition at line 89 of file Connectivity.cpp.

                                                           {
    tab1_free_memory_(tab1_ptr);
  }

tab1_free_memory_()

void tab1_free_memory_

(

tab1_t **

tab_ptr

)

Definition at line 199 of file Connectivity.cpp.

{
  if ((*tab_ptr) != nullptr) {
    delete (*tab_ptr);
    (*tab_ptr) = nullptr;
  }
}

TAB1_GET()

void _FCALL TAB1_GET	(	tab1_t **	tab1_ptr,
		int *	ii )

Definition at line 86 of file Connectivity.cpp.

                                                   {
    tab1_get_(tab1_ptr, ii);
  }

tab1_get_()

void tab1_get_	(	tab1_t **	tab_ptr,
		int *	out )

Definition at line 192 of file Connectivity.cpp.

{
  int ss = (*tab_ptr)->size();
  for (int i(0) ; i < ss ; ++i) {
    out[i] = (*tab_ptr)->at(i);
  }
}

TAB1_GET_SIZE()

void _FCALL TAB1_GET_SIZE	(	tab1_t **	tab1_ptr,
		int *	ii )

Definition at line 83 of file Connectivity.cpp.

                                                        {
    tab1_get_size_(tab1_ptr, ii);
  }

tab1_get_size_()

void tab1_get_size_	(	tab1_t **	tab_ptr,
		int *	ss )

Definition at line 188 of file Connectivity.cpp.

{
  *ss = (*tab_ptr)->size();
}

TAB1_INIT()

void _FCALL TAB1_INIT

(

tab1_t **

tab1_ptr

)

Definition at line 74 of file Connectivity.cpp.

                                           {
    tab1_init_(tab1_ptr);
  }

tab1_init_()

void tab1_init_

(

tab1_t **

tab_ptr

)

Definition at line 174 of file Connectivity.cpp.

{
  (*tab_ptr) = new tab1_t;
}