Home
last modified time | relevance | path

Searched refs:next_nonsingleton (Results 1 – 12 of 12) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/isomorphism/bliss/
H A Dpartition.cc98 cells[0].next_nonsingleton = 0; in init()
123 cells[i].next_nonsingleton = 0; in init()
313 if(cell->next_nonsingleton) in aux_split_in_two()
323 new_cell->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
338 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
341 if(cell->next_nonsingleton) in aux_split_in_two()
343 cell->next_nonsingleton = 0; in aux_split_in_two()
530 if(cell->next_nonsingleton) in sort_and_split_cell1()
538 new_cell->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
552 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
[all …]
H A Dgraph.cc2884 cell = cell->next_nonsingleton) in sh_first()
2906 cell = cell->next_nonsingleton) in sh_first_smallest()
2931 cell = cell->next_nonsingleton) in sh_first_largest()
2960 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
3029 cell = cell->next_nonsingleton) in sh_first_smallest_max_neighbours()
3103 cell = cell->next_nonsingleton) in sh_first_largest_max_neighbours()
4450 cell = cell->next_nonsingleton) in sh_first()
4471 cell = cell->next_nonsingleton) in sh_first_smallest()
4495 cell = cell->next_nonsingleton) in sh_first_largest()
4524 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
[all …]
H A Dpartition.hh69 Cell* next_nonsingleton; member in bliss::Partition::Cell
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/bliss-0.73/
H A Dpartition.cc231 cell->next_nonsingleton = 0; in goto_backtrack_point()
291 if(cell->next_nonsingleton) in aux_split_in_two()
301 new_cell->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
316 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
319 if(cell->next_nonsingleton) in aux_split_in_two()
547 if(cell->next_nonsingleton) in sort_and_split_cell1()
555 new_cell->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
556 if(new_cell->next_nonsingleton) in sort_and_split_cell1()
569 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
572 if(cell->next_nonsingleton) in sort_and_split_cell1()
[all …]
H A Dgraph.cc3137 cell = cell->next_nonsingleton) in sh_first()
3159 cell = cell->next_nonsingleton) in sh_first_smallest()
3184 cell = cell->next_nonsingleton) in sh_first_largest()
3213 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
3282 cell = cell->next_nonsingleton) in sh_first_smallest_max_neighbours()
3356 cell = cell->next_nonsingleton) in sh_first_largest_max_neighbours()
4976 cell = cell->next_nonsingleton) in sh_first()
4997 cell = cell->next_nonsingleton) in sh_first_smallest()
5021 cell = cell->next_nonsingleton) in sh_first_largest()
5050 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
[all …]
H A Dpartition.hh72 Cell* next_nonsingleton; member in bliss_digraphs::Partition::Cell
/dports/math/R-cran-igraph/igraph/src/bliss/
H A Dpartition.cc102 cells[0].next_nonsingleton = 0; in init()
248 cell->next_nonsingleton = 0; in goto_backtrack_point()
308 if(cell->next_nonsingleton) in aux_split_in_two()
318 new_cell->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
333 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
564 if(cell->next_nonsingleton) in sort_and_split_cell1()
572 new_cell->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
573 if(new_cell->next_nonsingleton) in sort_and_split_cell1()
586 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
589 if(cell->next_nonsingleton) in sort_and_split_cell1()
[all …]
H A Dgraph.cc1580 c = c->next_nonsingleton) { in search()
1683 c = c->next_nonsingleton) { in search()
3175 cell = cell->next_nonsingleton) in sh_first()
3197 cell = cell->next_nonsingleton) in sh_first_smallest()
3222 cell = cell->next_nonsingleton) in sh_first_largest()
3251 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
3320 cell = cell->next_nonsingleton) in sh_first_smallest_max_neighbours()
3394 cell = cell->next_nonsingleton) in sh_first_largest_max_neighbours()
5009 cell = cell->next_nonsingleton) in sh_first()
5030 cell = cell->next_nonsingleton) in sh_first_smallest()
[all …]
H A Dpartition.hh72 Cell* next_nonsingleton; member in bliss::Partition::Cell
/dports/math/bliss/bliss-0.73/
H A Dpartition.cc97 cells[0].next_nonsingleton = 0; in init()
243 cell->next_nonsingleton = 0; in goto_backtrack_point()
303 if(cell->next_nonsingleton) in aux_split_in_two()
313 new_cell->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
328 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in aux_split_in_two()
559 if(cell->next_nonsingleton) in sort_and_split_cell1()
567 new_cell->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
568 if(new_cell->next_nonsingleton) in sort_and_split_cell1()
581 cell->prev_nonsingleton->next_nonsingleton = cell->next_nonsingleton; in sort_and_split_cell1()
584 if(cell->next_nonsingleton) in sort_and_split_cell1()
[all …]
H A Dgraph.cc1588 c = c->next_nonsingleton) { in search()
1691 c = c->next_nonsingleton) { in search()
3180 cell = cell->next_nonsingleton) in sh_first()
3202 cell = cell->next_nonsingleton) in sh_first_smallest()
3227 cell = cell->next_nonsingleton) in sh_first_largest()
3256 cell = cell->next_nonsingleton) in sh_first_max_neighbours()
3325 cell = cell->next_nonsingleton) in sh_first_smallest_max_neighbours()
3399 cell = cell->next_nonsingleton) in sh_first_largest_max_neighbours()
5025 cell = cell->next_nonsingleton) in sh_first()
5046 cell = cell->next_nonsingleton) in sh_first_smallest()
[all …]
H A Dpartition.hh72 Cell* next_nonsingleton; member in bliss::Partition::Cell