@@ -65,7 +65,7 @@ cdef extern from "bliss_cpp/bliss_find_automorphisms.h":
6565 void bliss_find_automorphisms(Graph* , void (* )(void * , unsigned int , const unsigned int * ), void * , Stats& )
6666 void bliss_find_automorphisms(Digraph* , void (* )(void * , unsigned int , const unsigned int * ), void * , Stats& )
6767
68- cdef int encoding_numbits(int n):
68+ cdef int encoding_numbits(int n) noexcept :
6969 r """
7070 Return the number of bits needed to encode the `n` numbers from `1` to
7171 `n`. In other words, the last bit set in `n`.
@@ -79,7 +79,7 @@ cdef int encoding_numbits(int n):
7979 return i
8080
8181
82- cdef void add_gen(void * user_param, unsigned int n, const unsigned int * aut):
82+ cdef void add_gen(void * user_param, unsigned int n, const unsigned int * aut) noexcept :
8383 r """
8484 Function called each time a new generator of the automorphism group is
8585 found.
@@ -129,7 +129,7 @@ cdef void add_gen(void *user_param, unsigned int n, const unsigned int *aut):
129129# constructing bliss graphs from edge lists
130130# ####################################################
131131
132- cdef Graph * bliss_graph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels, partition):
132+ cdef Graph * bliss_graph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels, partition) noexcept :
133133 r """
134134 Return a bliss graph from the input data
135135
@@ -220,7 +220,7 @@ cdef Graph *bliss_graph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels,
220220
221221 return g
222222
223- cdef Digraph * bliss_digraph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels, partition):
223+ cdef Digraph * bliss_digraph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels, partition) noexcept :
224224 r """
225225 Return a bliss digraph from the input data
226226
@@ -301,7 +301,7 @@ cdef Digraph *bliss_digraph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, lab
301301# ####################################################
302302
303303cdef canonical_form_from_edge_list(int Vnr, list Vout, list Vin, int Lnr = 1 , list labels = [],
304- list partition = None , bint directed = False , bint certificate = False ):
304+ list partition = None , bint directed = False , bint certificate = False ) noexcept :
305305 r """
306306 Return an unsorted list of labelled edges of a canonical form.
307307
@@ -378,7 +378,7 @@ cdef canonical_form_from_edge_list(int Vnr, list Vout, list Vin, int Lnr=1, list
378378 return new_edges
379379
380380
381- cpdef canonical_form(G, partition = None , return_graph = False , use_edge_labels = True , certificate = False ):
381+ cpdef canonical_form(G, partition = None , return_graph = False , use_edge_labels = True , certificate = False ) noexcept :
382382 r """
383383 Return a canonical label for the given ( di) graph.
384384
@@ -599,7 +599,7 @@ cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True
599599# ####################################################
600600
601601cdef automorphism_group_gens_from_edge_list(int Vnr, Vout, Vin, int Lnr = 1 , labels = [],
602- int2vert = [], partition = None , bint directed = False ):
602+ int2vert = [], partition = None , bint directed = False ) noexcept :
603603 r """
604604 Return an unsorted list of labelled edges of a canonical form.
605605
@@ -650,7 +650,7 @@ cdef automorphism_group_gens_from_edge_list(int Vnr, Vout, Vin, int Lnr=1, label
650650
651651 return [[cyc for cyc in gen if cyc[0 ] is not None ] for gen in gens]
652652
653- cpdef automorphism_group(G, partition = None , use_edge_labels = True ):
653+ cpdef automorphism_group(G, partition = None , use_edge_labels = True ) noexcept :
654654 """
655655 Return the automorphism group of the given (di)graph.
656656
@@ -848,7 +848,7 @@ cpdef automorphism_group(G, partition=None, use_edge_labels=True):
848848# old direct interactions graphs <-> bliss graphs
849849# ####################################################
850850
851- cdef Graph * bliss_graph(G, partition, vert2int, int2vert):
851+ cdef Graph * bliss_graph(G, partition, vert2int, int2vert) noexcept :
852852 r """
853853 Return a bliss copy of a graph G
854854
@@ -882,7 +882,7 @@ cdef Graph *bliss_graph(G, partition, vert2int, int2vert):
882882 return g
883883
884884
885- cdef Digraph * bliss_digraph(G, partition, vert2int, int2vert):
885+ cdef Digraph * bliss_digraph(G, partition, vert2int, int2vert) noexcept :
886886 r """
887887 Return a bliss copy of a digraph G
888888
0 commit comments