Functions

src/degeneracy_helper.c File Reference

A collection of functions to compute degeneracy and degeneracy order. More...

#include <limits.h>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "misc.h"
#include "LinkedList.h"
#include "MemoryManager.h"
#include "degeneracy_helper.h"

Functions

int computeDegeneracy (LinkedList **list, int size)
NeighborList ** computeDegeneracyOrderList (LinkedList **list, int size)
NeighborListArray ** computeDegeneracyOrderArray (LinkedList **list, int size)

Detailed Description

A collection of functions to compute degeneracy and degeneracy order.

Author:
Darren Strash (first name DOT last name AT gmail DOT com)

Copyright (c) 2011 Darren Strash. This code is released under the GNU Public License (GPL) 3.0.

gplv3-127x51.png
See GPL 3.0 here

Function Documentation

int computeDegeneracy ( LinkedList **  list,
int  size 
)
Parameters:
list an input graph, represented as an array of linked lists of integers
size the number of vertices in the graph
Returns:
the degeneracy of the input graph.
NeighborListArray** computeDegeneracyOrderArray ( LinkedList **  list,
int  size 
)
Parameters:
list an input graph, represented as an array of linked lists of integers
size the number of vertices in the graph
Returns:
an array of NeighborListArrays representing a degeneracy ordering of the vertices.
See also:
NeighborListArray
NeighborList** computeDegeneracyOrderList ( LinkedList **  list,
int  size 
)
Parameters:
list an input graph, represented as an array of linked lists of integers
size the number of vertices in the graph
Returns:
an array of NeighborLists representing a degeneracy ordering of the vertices.
See also:
NeighborList
 All Data Structures Files Functions Variables Typedefs Defines