1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2003-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include "igraph_adjlist.h"
#include "igraph_memory.h"
#include "igraph_interface.h"
#include "igraph_interrupt_internal.h"
#include "config.h"
#include <string.h> /* memset */
#include <stdio.h>
/**
* \section about_adjlists
* <para>Sometimes it is easier to work with a graph which is in
* adjacency list format: a list of vectors; each vector contains the
* neighbor vertices or incident edges of a given vertex. Typically,
* this representation is good if we need to iterate over the neighbors
* of all vertices many times. E.g. when finding the shortest paths
* between every pairs of vertices or calculating closeness centrality
* for all the vertices.</para>
*
* <para>The <type>igraph_adjlist_t</type> stores the adjacency lists
* of a graph. After creation it is independent of the original graph,
* it can be modified freely with the usual vector operations, the
* graph is not affected. E.g. the adjacency list can be used to
* rewire the edges of a graph efficiently. If one used the
* straightforward \ref igraph_delete_edges() and \ref
* igraph_add_edges() combination for this that needs O(|V|+|E|) time
* for every single deletion and insertion operation, it is thus very
* slow if many edges are rewired. Extracting the graph into an
* adjacency list, do all the rewiring operations on the vectors of
* the adjacency list and then creating a new graph needs (depending
* on how exactly the rewiring is done) typically O(|V|+|E|) time for
* the whole rewiring process.</para>
*
* <para>Lazy adjacency lists are a bit different. When creating a
* lazy adjacency list, the neighbors of the vertices are not queried,
* only some memory is allocated for the vectors. When \ref
* igraph_lazy_adjlist_get() is called for vertex v the first time,
* the neighbors of v are queried and stored in a vector of the
* adjacency list, so they don't need to be queried again. Lazy
* adjacency lists are handy if you have an at least linear operation
* (because initialization is generally linear in terms of number of
* vertices), but you don't know how many vertices you will visit
* during the computation.
* </para>
*
* <para>
* \example examples/simple/adjlist.c
* </para>
*/
/**
* \function igraph_adjlist_init
* Initialize an adjacency list of vertices from a given graph
*
* Create a list of vectors containing the neighbors of all vertices
* in a graph. The adjacency list is independent of the graph after
* creation, e.g. the graph can be destroyed and modified, the
* adjacency list contains the state of the graph at the time of its
* initialization.
* \param graph The input graph.
* \param al Pointer to an uninitialized <type>igraph_adjlist_t</type> object.
* \param mode Constant specifying whether outgoing
* (<code>IGRAPH_OUT</code>), incoming (<code>IGRAPH_IN</code>),
* or both (<code>IGRAPH_ALL</code>) types of neighbors to include
* in the adjacency list. It is ignored for undirected networks.
* \return Error code.
*
* Time complexity: O(|V|+|E|), linear in the number of vertices and
* edges.
*/
int igraph_adjlist_init(const igraph_t *graph, igraph_adjlist_t *al,
igraph_neimode_t mode) {
igraph_integer_t i;
igraph_vector_t tmp;
if (mode != IGRAPH_IN && mode != IGRAPH_OUT && mode != IGRAPH_ALL) {
IGRAPH_ERROR("Cannot create adjlist view", IGRAPH_EINVMODE);
}
igraph_vector_init(&tmp, 0);
IGRAPH_FINALLY(igraph_vector_destroy, &tmp);
if (!igraph_is_directed(graph)) { mode=IGRAPH_ALL; }
al->length=igraph_vcount(graph);
al->adjs=igraph_Calloc(al->length, igraph_vector_int_t);
if (al->adjs == 0) {
IGRAPH_ERROR("Cannot create adjlist view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_adjlist_destroy, al);
for (i=0; i<al->length; i++) {
int j, n;
IGRAPH_ALLOW_INTERRUPTION();
IGRAPH_CHECK(igraph_neighbors(graph, &tmp, i, mode));
n=igraph_vector_size(&tmp);
IGRAPH_CHECK(igraph_vector_int_init(&al->adjs[i], n));
for (j=0; j<n; j++) {
VECTOR(al->adjs[i])[j] = VECTOR(tmp)[j];
}
}
igraph_vector_destroy(&tmp);
IGRAPH_FINALLY_CLEAN(2);
return 0;
}
/**
* \function igraph_adjlist_init_empty
* Initialize an empty adjacency list
*
* Creates a list of vectors, one for each vertex. This is useful when you
* are \em constructing a graph using an adjacency list representation as
* it does not require your graph to exist yet.
* \param no_of_nodes The number of vertices
* \param al Pointer to an uninitialized <type>igraph_adjlist_t</type> object.
* \return Error code.
*
* Time complexity: O(|V|), linear in the number of vertices.
*/
int igraph_adjlist_init_empty(igraph_adjlist_t *al, igraph_integer_t no_of_nodes) {
long int i;
al->length=no_of_nodes;
al->adjs=igraph_Calloc(al->length, igraph_vector_int_t);
if (al->adjs == 0) {
IGRAPH_ERROR("Cannot create adjlist view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_adjlist_destroy, al);
for (i=0; i<al->length; i++) {
IGRAPH_CHECK(igraph_vector_int_init(&al->adjs[i], 0));
}
IGRAPH_FINALLY_CLEAN(1);
return 0;
}
/**
* \function igraph_adjlist_init_complementer
* Adjacency lists for the complementer graph
*
* This function creates adjacency lists for the complementer
* of the input graph. In the complementer graph all edges are present
* which are not present in the original graph. Multiple edges in the
* input graph are ignored.
* \param graph The input graph.
* \param al Pointer to a not yet initialized adjacency list.
* \param mode Constant specifying whether outgoing
* (<code>IGRAPH_OUT</code>), incoming (<code>IGRAPH_IN</code>),
* or both (<code>IGRAPH_ALL</code>) types of neighbors (in the
* complementer graph) to include in the adjacency list. It is
* ignored for undirected networks.
* \param loops Whether to consider loop edges.
* \return Error code.
*
* Time complexity: O(|V|^2+|E|), quadratic in the number of vertices.
*/
int igraph_adjlist_init_complementer(const igraph_t *graph,
igraph_adjlist_t *al,
igraph_neimode_t mode,
igraph_bool_t loops) {
igraph_integer_t i, j, k, n;
igraph_bool_t* seen;
igraph_vector_t vec;
if (mode != IGRAPH_IN && mode != IGRAPH_OUT && mode != IGRAPH_ALL) {
IGRAPH_ERROR("Cannot create complementer adjlist view", IGRAPH_EINVMODE);
}
if (!igraph_is_directed(graph)) { mode=IGRAPH_ALL; }
al->length=igraph_vcount(graph);
al->adjs=igraph_Calloc(al->length, igraph_vector_int_t);
if (al->adjs == 0) {
IGRAPH_ERROR("Cannot create complementer adjlist view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_adjlist_destroy, al);
n=al->length;
seen=igraph_Calloc(n, igraph_bool_t);
if (seen==0) {
IGRAPH_ERROR("Cannot create complementer adjlist view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_free, seen);
IGRAPH_VECTOR_INIT_FINALLY(&vec, 0);
for (i=0; i<al->length; i++) {
IGRAPH_ALLOW_INTERRUPTION();
igraph_neighbors(graph, &vec, i, mode);
memset(seen, 0, sizeof(igraph_bool_t)*(unsigned) al->length);
n=al->length;
if (!loops) { seen[i] = 1; n--; }
for (j=0; j<igraph_vector_size(&vec); j++) {
if (! seen [ (long int) VECTOR(vec)[j] ] ) {
n--;
seen[ (long int) VECTOR(vec)[j] ] = 1;
}
}
IGRAPH_CHECK(igraph_vector_int_init(&al->adjs[i], n));
for (j=0, k=0; k<n; j++) {
if (!seen[j]) {
VECTOR(al->adjs[i])[k++] = j;
}
}
}
igraph_Free(seen);
igraph_vector_destroy(&vec);
IGRAPH_FINALLY_CLEAN(3);
return 0;
}
/**
* \function igraph_adjlist_destroy
* Deallocate memory
*
* Free all memory allocated for an adjacency list.
* \param al The adjacency list to destroy.
*
* Time complexity: depends on memory management.
*/
void igraph_adjlist_destroy(igraph_adjlist_t *al) {
long int i;
for (i=0; i<al->length; i++) {
if (&al->adjs[i]) { igraph_vector_int_destroy(&al->adjs[i]); }
}
igraph_Free(al->adjs);
}
/**
* \function igraph_adjlist_clear
* Removes all edges from an adjacency list.
*
* \param al The adjacency list.
* Time complexity: depends on memory management, typically O(n), where n is
* the total number of elements in the adjacency list.
*/
void igraph_adjlist_clear(igraph_adjlist_t *al) {
long int i;
for (i=0; i<al->length; i++) {
igraph_vector_int_clear(&al->adjs[i]);
}
}
/**
* \function igraph_adjlist_size
* Number of vertices in an adjacency list.
*
* \param al The adjacency list.
* \return The number of elements.
*
* Time complexity: O(1).
*/
igraph_integer_t igraph_adjlist_size(const igraph_adjlist_t *al) {
return al->length;
}
/* igraph_vector_int_t *igraph_adjlist_get(igraph_adjlist_t *al, igraph_integer_t no) { */
/* return &al->adjs[(long int)no]; */
/* } */
/**
* \function igraph_adjlist_sort
* Sort each vector in an adjacency list.
*
* Sorts every vector of the adjacency list.
* \param al The adjacency list.
*
* Time complexity: O(n log n), n is the total number of elements in
* the adjacency list.
*/
void igraph_adjlist_sort(igraph_adjlist_t *al) {
long int i;
for (i=0; i<al->length; i++)
igraph_vector_int_sort(&al->adjs[i]);
}
/**
* \function igraph_adjlist_simplify
* Simplify
*
* Simplify an adjacency list, ie. remove loop and multiple edges.
* \param al The adjacency list.
* \return Error code.
*
* Time complexity: O(|V|+|E|), linear in the number of edges and
* vertices.
*/
int igraph_adjlist_simplify(igraph_adjlist_t *al) {
long int i;
long int n=al->length;
igraph_vector_int_t mark;
igraph_vector_int_init(&mark, n);
IGRAPH_FINALLY(igraph_vector_int_destroy, &mark);
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->adjs[i];
long int j, l=igraph_vector_int_size(v);
VECTOR(mark)[i] = i+1;
for (j=0; j<l; /* nothing */) {
long int e=(long int) VECTOR(*v)[j];
if (VECTOR(mark)[e] != i+1) {
VECTOR(mark)[e]=i+1;
j++;
} else {
VECTOR(*v)[j] = igraph_vector_int_tail(v);
igraph_vector_int_pop_back(v);
l--;
}
}
}
igraph_vector_int_destroy(&mark);
IGRAPH_FINALLY_CLEAN(1);
return 0;
}
int igraph_adjlist_remove_duplicate(const igraph_t *graph,
igraph_adjlist_t *al) {
long int i;
long int n=al->length;
IGRAPH_UNUSED(graph);
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->adjs[i];
long int j, p=1, l=igraph_vector_int_size(v);
for (j=1; j<l; j++) {
long int e=(long int) VECTOR(*v)[j];
/* Non-loop edges, and one end of loop edges are fine. */
/* We use here, that the vector is sorted and we also keep it sorted */
if (e != i || VECTOR(*v)[j-1] != e) {
VECTOR(*v)[p++] = e;
}
}
igraph_vector_int_resize(v, p);
}
return 0;
}
#ifndef USING_R
int igraph_adjlist_print(const igraph_adjlist_t *al) {
long int i;
long int n=al->length;
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->adjs[i];
igraph_vector_int_print(v);
}
return 0;
}
#endif
int igraph_adjlist_fprint(const igraph_adjlist_t *al, FILE *outfile) {
long int i;
long int n=al->length;
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->adjs[i];
igraph_vector_int_fprint(v, outfile);
}
return 0;
}
int igraph_adjedgelist_remove_duplicate(const igraph_t *graph,
igraph_inclist_t *al) {
IGRAPH_WARNING("igraph_adjedgelist_remove_duplicate() is deprecated, use "
"igraph_inclist_remove_duplicate() instead");
return igraph_inclist_remove_duplicate(graph, al);
}
#ifndef USING_R
int igraph_adjedgelist_print(const igraph_inclist_t *al, FILE *outfile) {
IGRAPH_WARNING("igraph_adjedgelist_print() is deprecated, use "
"igraph_inclist_print() instead");
return igraph_inclist_fprint(al, outfile);
}
#endif
/**
* \function igraph_adjedgelist_init
* Initialize an incidence list of edges
*
* This function was superseded by \ref igraph_inclist_init() in igraph 0.6.
* Please use \ref igraph_inclist_init() instead of this function.
*
* </para><para>
* Deprecated in version 0.6.
*/
int igraph_adjedgelist_init(const igraph_t *graph,
igraph_inclist_t *il,
igraph_neimode_t mode) {
IGRAPH_WARNING("igraph_adjedgelist_init() is deprecated, use "
"igraph_inclist_init() instead");
return igraph_inclist_init(graph, il, mode);
}
/**
* \function igraph_adjedgelist_destroy
* Frees all memory allocated for an incidence list.
*
* This function was superseded by \ref igraph_inclist_destroy() in igraph 0.6.
* Please use \ref igraph_inclist_destroy() instead of this function.
*
* </para><para>
* Deprecated in version 0.6.
*/
void igraph_adjedgelist_destroy(igraph_inclist_t *il) {
IGRAPH_WARNING("igraph_adjedgelist_destroy() is deprecated, use "
"igraph_inclist_destroy() instead");
igraph_inclist_destroy(il);
}
int igraph_inclist_remove_duplicate(const igraph_t *graph,
igraph_inclist_t *al) {
long int i;
long int n=al->length;
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->incs[i];
long int j, p=1, l=igraph_vector_int_size(v);
for (j=1; j<l; j++) {
long int e=(long int) VECTOR(*v)[j];
/* Non-loop edges and one end of loop edges are fine. */
/* We use here, that the vector is sorted and we also keep it sorted */
if (IGRAPH_FROM(graph, e) != IGRAPH_TO(graph, e) ||
VECTOR(*v)[j-1] != e) {
VECTOR(*v)[p++] = e;
}
}
igraph_vector_int_resize(v, p);
}
return 0;
}
#ifndef USING_R
int igraph_inclist_print(const igraph_inclist_t *al) {
long int i;
long int n=al->length;
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->incs[i];
igraph_vector_int_print(v);
}
return 0;
}
#endif
int igraph_inclist_fprint(const igraph_inclist_t *al, FILE *outfile) {
long int i;
long int n=al->length;
for (i=0; i<n; i++) {
igraph_vector_int_t *v=&al->incs[i];
igraph_vector_int_fprint(v, outfile);
}
return 0;
}
/**
* \function igraph_inclist_init
* Initialize an incidence list of edges
*
* Create a list of vectors containing the incident edges for all
* vertices. The incidence list is independent of the graph after
* creation, subsequent changes of the graph object do not update the
* incidence list, and changes to the incidence list do not update the
* graph.
* \param graph The input graph.
* \param il Pointer to an uninitialized incidence list.
* \param mode Constant specifying whether incoming edges
* (<code>IGRAPH_IN</code>), outgoing edges (<code>IGRAPH_OUT</code>) or
* both (<code>IGRAPH_ALL</code>) to include in the incidence lists
* of directed graphs. It is ignored for undirected graphs.
* \return Error code.
*
* Time complexity: O(|V|+|E|), linear in the number of vertices and
* edges.
*/
int igraph_inclist_init(const igraph_t *graph,
igraph_inclist_t *il,
igraph_neimode_t mode) {
igraph_integer_t i;
igraph_vector_t tmp;
if (mode != IGRAPH_IN && mode != IGRAPH_OUT && mode != IGRAPH_ALL) {
IGRAPH_ERROR("Cannot create incidence list view", IGRAPH_EINVMODE);
}
igraph_vector_init(&tmp, 0);
IGRAPH_FINALLY(igraph_vector_destroy, &tmp);
if (!igraph_is_directed(graph)) { mode=IGRAPH_ALL; }
il->length=igraph_vcount(graph);
il->incs=igraph_Calloc(il->length, igraph_vector_int_t);
if (il->incs == 0) {
IGRAPH_ERROR("Cannot create incidence list view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_inclist_destroy, il);
for (i=0; i<il->length; i++) {
int j, n;
IGRAPH_ALLOW_INTERRUPTION();
IGRAPH_CHECK(igraph_incident(graph, &tmp, i, mode));
n=igraph_vector_size(&tmp);
IGRAPH_CHECK(igraph_vector_int_init(&il->incs[i], n));
for (j=0; j<n; j++) {
VECTOR(il->incs[i])[j] = VECTOR(tmp)[j];
}
}
igraph_vector_destroy(&tmp);
IGRAPH_FINALLY_CLEAN(2);
return 0;
}
/**
* \function igraph_inclist_init_empty
* \brief Initialize an incidence list corresponding to an empty graph.
*
* This function essentially creates a list of empty vectors that may
* be treated as an incidence list for a graph with a given number of
* vertices.
*
* \param il Pointer to an uninitialized incidence list.
* \param n The number of vertices in the incidence list.
* \return Error code.
*
* Time complexity: O(|V|), linear in the number of vertices.
*/
int igraph_inclist_init_empty(igraph_inclist_t *il, igraph_integer_t n) {
long int i;
il->length=n;
il->incs=igraph_Calloc(il->length, igraph_vector_int_t);
if (il->incs == 0) {
IGRAPH_ERROR("Cannot create incidence list view", IGRAPH_ENOMEM);
}
IGRAPH_FINALLY(igraph_inclist_destroy, il);
for (i=0; i<n; i++) {
IGRAPH_CHECK(igraph_vector_int_init(&il->incs[i], 0));
}
IGRAPH_FINALLY_CLEAN(1);
return 0;
}
/**
* \function igraph_inclist_destroy
* Frees all memory allocated for an incidence list.
*
* \param eal The incidence list to destroy.
*
* Time complexity: depends on memory management.
*/
void igraph_inclist_destroy(igraph_inclist_t *il) {
long int i;
for (i=0; i<il->length; i++) {
/* This works if some igraph_vector_int_t's are 0,
because igraph_vector_destroy can handle this. */
igraph_vector_int_destroy(&il->incs[i]);
}
igraph_Free(il->incs);
}
/**
* \function igraph_inclist_clear
* Removes all edges from an incidence list.
*
* \param il The incidence list.
* Time complexity: depends on memory management, typically O(n), where n is
* the total number of elements in the incidence list.
*/
void igraph_inclist_clear(igraph_inclist_t *il) {
long int i;
for (i=0; i<il->length; i++) {
igraph_vector_int_clear(&il->incs[i]);
}
}
/**
* \function igraph_lazy_adjlist_init
* Constructor
*
* Create a lazy adjacency list for vertices. This function only
* allocates some memory for storing the vectors of an adjacency list,
* but the neighbor vertices are not queried, only at the \ref
* igraph_lazy_adjlist_get() calls.
* \param graph The input graph.
* \param al Pointer to an uninitialized adjacency list object.
* \param mode Constant, it gives whether incoming edges
* (<code>IGRAPH_IN</code>), outgoing edges
* (<code>IGRPAH_OUT</code>) or both types of edges
* (<code>IGRAPH_ALL</code>) are considered. It is ignored for
* undirected graphs.
* \param simplify Constant, it gives whether to simplify the vectors
* in the adjacency list (<code>IGRAPH_SIMPLIFY</code>) or not
* (<code>IGRAPH_DONT_SIMPLIFY</code>).
* \return Error code.
*
* Time complexity: O(|V|), the number of vertices, possibly, but
* depends on the underlying memory management too.
*/
int igraph_lazy_adjlist_init(const igraph_t *graph,
igraph_lazy_adjlist_t *al,
igraph_neimode_t mode,
igraph_lazy_adlist_simplify_t simplify) {
if (mode != IGRAPH_IN && mode != IGRAPH_OUT && mode != IGRAPH_ALL) {
IGRAPH_ERROR("Cannor create adjlist view", IGRAPH_EINVMODE);
}
if (!igraph_is_directed(graph)) { mode=IGRAPH_ALL; }
al->mode=mode;
al->simplify=simplify;
al->graph=graph;
al->length=igraph_vcount(graph);
al->adjs=igraph_Calloc(al->length, igraph_vector_t*);
if (al->adjs == 0) {
IGRAPH_ERROR("Cannot create lazy adjlist view", IGRAPH_ENOMEM);
}
return 0;
}
/**
* \function igraph_lazy_adjlist_destroy
* Deallocate memory
*
* Free all allocated memory for a lazy adjacency list.
* \param al The adjacency list to deallocate.
*
* Time complexity: depends on the memory management.
*/
void igraph_lazy_adjlist_destroy(igraph_lazy_adjlist_t *al) {
igraph_lazy_adjlist_clear(al);
igraph_Free(al->adjs);
}
/**
* \function igraph_lazy_adjlist_clear
* Removes all edges from a lazy adjacency list.
*
* \param al The lazy adjacency list.
* Time complexity: depends on memory management, typically O(n), where n is
* the total number of elements in the adjacency list.
*/
void igraph_lazy_adjlist_clear(igraph_lazy_adjlist_t *al) {
long int i, n=al->length;
for (i=0; i<n; i++) {
if (al->adjs[i] != 0) {
igraph_vector_destroy(al->adjs[i]);
igraph_Free(al->adjs[i]);
}
}
}
igraph_vector_t *igraph_lazy_adjlist_get_real(igraph_lazy_adjlist_t *al,
igraph_integer_t pno) {
igraph_integer_t no=pno;
int ret;
if (al->adjs[no] == 0) {
al->adjs[no] = igraph_Calloc(1, igraph_vector_t);
if (al->adjs[no] == 0) {
igraph_error("Lazy adjlist failed", __FILE__, __LINE__,
IGRAPH_ENOMEM);
}
ret=igraph_vector_init(al->adjs[no], 0);
if (ret != 0) {
igraph_error("", __FILE__, __LINE__, ret);
}
ret=igraph_neighbors(al->graph, al->adjs[no], no, al->mode);
if (ret != 0) {
igraph_error("", __FILE__, __LINE__, ret);
}
if (al->simplify == IGRAPH_SIMPLIFY) {
igraph_vector_t *v=al->adjs[no];
long int i, p=0, n=igraph_vector_size(v);
for (i=0; i<n; i++) {
if (VECTOR(*v)[i] != no &&
(i==n-1 || VECTOR(*v)[i+1] != VECTOR(*v)[i])) {
VECTOR(*v)[p]=VECTOR(*v)[i];
p++;
}
}
igraph_vector_resize(v, p);
}
}
return al->adjs[no];
}
/**
* \function igraph_lazy_adjedgelist_init
* Initializes a lazy incidence list of edges
*
* This function was superseded by \ref igraph_lazy_inclist_init() in igraph 0.6.
* Please use \ref igraph_lazy_inclist_init() instead of this function.
*
* </para><para>
* Deprecated in version 0.6.
*/
int igraph_lazy_adjedgelist_init(const igraph_t *graph,
igraph_lazy_inclist_t *il,
igraph_neimode_t mode) {
IGRAPH_WARNING("igraph_lazy_adjedgelist_init() is deprecated, use "
"igraph_lazy_inclist_init() instead");
return igraph_lazy_inclist_init(graph, il, mode);
}
/**
* \function igraph_lazy_adjedgelist_destroy
* Frees all memory allocated for an incidence list.
*
* This function was superseded by \ref igraph_lazy_inclist_destroy() in igraph 0.6.
* Please use \ref igraph_lazy_inclist_destroy() instead of this function.
*
* </para><para>
* Deprecated in version 0.6.
*/
void igraph_lazy_adjedgelist_destroy(igraph_lazy_inclist_t *il) {
IGRAPH_WARNING("igraph_lazy_adjedgelist_destroy() is deprecated, use "
"igraph_lazy_inclist_destroy() instead");
igraph_lazy_inclist_destroy(il);
}
igraph_vector_t *igraph_lazy_adjedgelist_get_real(igraph_lazy_adjedgelist_t *il,
igraph_integer_t pno) {
IGRAPH_WARNING("igraph_lazy_adjedgelist_get_real() is deprecated, use "
"igraph_lazy_inclist_get_real() instead");
return igraph_lazy_inclist_get_real(il, pno);
}
/**
* \function igraph_lazy_inclist_init
* Initializes a lazy incidence list of edges
*
* Create a lazy incidence list for edges. This function only
* allocates some memory for storing the vectors of an incidence list,
* but the incident edges are not queried, only when \ref
* igraph_lazy_inclist_get() is called.
* \param graph The input graph.
* \param al Pointer to an uninitialized incidence list.
* \param mode Constant, it gives whether incoming edges
* (<code>IGRAPH_IN</code>), outgoing edges
* (<code>IGRPAH_OUT</code>) or both types of edges
* (<code>IGRAPH_ALL</code>) are considered. It is ignored for
* undirected graphs.
* \return Error code.
*
* Time complexity: O(|V|), the number of vertices, possibly. But it
* also depends on the underlying memory management.
*/
int igraph_lazy_inclist_init(const igraph_t *graph,
igraph_lazy_inclist_t *al,
igraph_neimode_t mode) {
if (mode != IGRAPH_IN && mode != IGRAPH_OUT && mode != IGRAPH_ALL) {
IGRAPH_ERROR("Cannot create lazy incidence list view", IGRAPH_EINVMODE);
}
if (!igraph_is_directed(graph)) { mode=IGRAPH_ALL; }
al->mode=mode;
al->graph=graph;
al->length=igraph_vcount(graph);
al->incs=igraph_Calloc(al->length, igraph_vector_t*);
if (al->incs == 0) {
IGRAPH_ERROR("Cannot create lazy incidence list view", IGRAPH_ENOMEM);
}
return 0;
}
/**
* \function igraph_lazy_inclist_destroy
* Deallocates memory
*
* Frees all allocated memory for a lazy incidence list.
* \param al The incidence list to deallocate.
*
* Time complexity: depends on memory management.
*/
void igraph_lazy_inclist_destroy(igraph_lazy_inclist_t *il) {
igraph_lazy_inclist_clear(il);
igraph_Free(il->incs);
}
/**
* \function igraph_lazy_inclist_clear
* Removes all edges from a lazy incidence list.
*
* \param il The lazy incidence list.
* Time complexity: depends on memory management, typically O(n), where n is
* the total number of elements in the incidence list.
*/
void igraph_lazy_inclist_clear(igraph_lazy_inclist_t *il) {
long int i, n=il->length;
for (i=0; i<n; i++) {
if (il->incs[i] != 0) {
igraph_vector_destroy(il->incs[i]);
igraph_Free(il->incs[i]);
}
}
}
igraph_vector_t *igraph_lazy_inclist_get_real(igraph_lazy_inclist_t *il,
igraph_integer_t pno) {
igraph_integer_t no=pno;
int ret;
if (il->incs[no] == 0) {
il->incs[no] = igraph_Calloc(1, igraph_vector_t);
if (il->incs[no] == 0) {
igraph_error("Lazy incidence list query failed", __FILE__, __LINE__,
IGRAPH_ENOMEM);
}
ret=igraph_vector_init(il->incs[no], 0);
if (ret != 0) {
igraph_error("", __FILE__, __LINE__, ret);
}
ret=igraph_incident(il->graph, il->incs[no], no, il->mode);
if (ret != 0) {
igraph_error("", __FILE__, __LINE__, ret);
}
}
return il->incs[no];
}
|