turbonss/src/graph.h

41 lines
1.4 KiB
C
Raw Normal View History

2004-12-23 15:16:30 +02:00
#ifndef _CMPH_GRAPH_H__
#define _CMPH_GRAPH_H__
#include <limits.h>
#include "cmph_types.h"
2005-01-18 23:06:08 +02:00
#define CMPH_GRAPH_NO_NEIGHBOR UINT_MAX
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
typedef struct cmph__graph_t cmph_graph_t;
typedef struct cmph__graph_iterator_t cmph_graph_iterator_t;
struct cmph__graph_iterator_t
2004-12-23 15:16:30 +02:00
{
2005-01-18 23:06:08 +02:00
cmph_uint32 vertex;
cmph_uint32 edge;
2004-12-23 15:16:30 +02:00
};
2005-01-18 23:06:08 +02:00
cmph_graph_t *cmph_graph_new(cmph_uint32 nnodes, cmph_uint32 nedges);
void cmph_graph_destroy(cmph_graph_t *graph);
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
void cmph_graph_add_edge(cmph_graph_t *g, cmph_uint32 v1, cmph_uint32 v2);
void cmph_graph_del_edge(cmph_graph_t *g, cmph_uint32 v1, cmph_uint32 v2);
void cmph_graph_clear_edges(cmph_graph_t *g);
cmph_uint32 cmph_graph_edge_id(cmph_graph_t *g, cmph_uint32 v1, cmph_uint32 v2);
cmph_uint8 cmph_graph_contains_edge(cmph_graph_t *g, cmph_uint32 v1, cmph_uint32 v2);
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
cmph_graph_iterator_t cmph_graph_neighbors_it(cmph_graph_t *g, cmph_uint32 v);
cmph_uint32 cmph_graph_next_neighbor(cmph_graph_t *g, cmph_graph_iterator_t* it);
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
void cmph_graph_obtain_critical_nodes(cmph_graph_t *g); /* included -- Fabiano*/
cmph_uint8 cmph_graph_node_is_critical(cmph_graph_t * g, cmph_uint32 v); /* included -- Fabiano */
cmph_uint32 cmph_graph_ncritical_nodes(cmph_graph_t *g); /* included -- Fabiano*/
cmph_uint32 cmph_graph_vertex_id(cmph_graph_t *g, cmph_uint32 e, cmph_uint32 id); /* included -- Fabiano*/
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
int cmph_graph_is_cyclic(cmph_graph_t *g);
2004-12-23 15:16:30 +02:00
2005-01-18 23:06:08 +02:00
void cmph_graph_print(cmph_graph_t *);
2004-12-23 15:16:30 +02:00
#endif