#include "bitmap.h"
#include "list.h"
#include "operation.h"
#include "queue.h"
#include "tm.h"
Go to the source code of this file.
|
#define | TMNET_APPLYOPERATION(net, op, from, to) |
|
#define | TMNET_HASEDGE(net, from, to) |
|
#define | TMNET_ISPATH(net, from, to, bmp, wq) |
|
#define | TMNET_FINDANCESTORS(net, id, bmp, wq) |
|
#define | TMNET_FINDDESCENDANTS(net, id, bmp, wq) |
|
|
net_t * | net_alloc (long numNode) |
|
void | net_free (net_t *netPtr) |
|
void | net_applyOperation (net_t *netPtr, operation_t op, long fromId, long toId) |
|
void | TMnet_applyOperation (TM_ARGDECL net_t *netPtr, operation_t op, long fromId, long toId) |
|
bool_t | net_hasEdge (net_t *netPtr, long fromId, long toId) |
|
bool_t | TMnet_hasEdge (TM_ARGDECL net_t *netPtr, long fromId, long toId) |
|
bool_t | net_isPath (net_t *netPtr, long fromId, long toId, bitmap_t *visitedBitmapPtr, queue_t *workQueuePtr) |
|
bool_t | TMnet_isPath (TM_ARGDECL net_t *netPtr, long fromId, long toId, bitmap_t *visitedBitmapPtr, queue_t *workQueuePtr) |
|
bool_t | net_isCycle (net_t *netPtr) |
|
list_t * | net_getParentIdListPtr (net_t *netPtr, long id) |
|
list_t * | net_getChildIdListPtr (net_t *netPtr, long id) |
|
bool_t | net_findAncestors (net_t *netPtr, long id, bitmap_t *ancestorBitmapPtr, queue_t *workQueuePtr) |
|
bool_t | TMnet_findAncestors (TM_ARGDECL net_t *netPtr, long id, bitmap_t *ancestorBitmapPtr, queue_t *workQueuePtr) |
|
bool_t | net_findDescendants (net_t *netPtr, long id, bitmap_t *descendantBitmapPtr, queue_t *workQueuePtr) |
|
bool_t | TMnet_findDescendants (TM_ARGDECL net_t *netPtr, long id, bitmap_t *descendantBitmapPtr, queue_t *workQueuePtr) |
|
void | net_generateRandomEdges (net_t *netPtr, long maxNumParent, long percentParent, random_t *randomPtr) |
|
#define TMNET_APPLYOPERATION |
( |
|
net, |
|
|
|
op, |
|
|
|
from, |
|
|
|
to |
|
) |
| |
Value:
op, \
from, \
to)
#define TM_ARG
Definition: cxxtm.hpp:40
void TMnet_applyOperation(TM_ARGDECL net_t *netPtr, operation_t op, long fromId, long toId)
Definition: net.c:359
#define TMNET_FINDANCESTORS |
( |
|
net, |
|
|
|
id, |
|
|
|
bmp, |
|
|
|
wq |
|
) |
| |
Value:
id, \
bmp, \
wq)
#define TM_ARG
Definition: cxxtm.hpp:40
bool_t TMnet_findAncestors(TM_ARGDECL net_t *netPtr, long id, bitmap_t *ancestorBitmapPtr, queue_t *workQueuePtr)
Definition: net.c:685
#define TMNET_FINDDESCENDANTS |
( |
|
net, |
|
|
|
id, |
|
|
|
bmp, |
|
|
|
wq |
|
) |
| |
Value:
id, \
bmp, \
wq)
#define TM_ARG
Definition: cxxtm.hpp:40
bool_t TMnet_findDescendants(TM_ARGDECL net_t *netPtr, long id, bitmap_t *descendantBitmapPtr, queue_t *workQueuePtr)
Definition: net.c:804
#define TMNET_HASEDGE |
( |
|
net, |
|
|
|
from, |
|
|
|
to |
|
) |
| |
Value:
from, \
to)
#define TM_ARG
Definition: cxxtm.hpp:40
bool_t TMnet_hasEdge(TM_ARGDECL net_t *netPtr, long fromId, long toId)
Definition: net.c:401
#define TMNET_ISPATH |
( |
|
net, |
|
|
|
from, |
|
|
|
to, |
|
|
|
bmp, |
|
|
|
wq |
|
) |
| |
Value:
from, \
to, \
bmp, \
wq)
#define TM_ARG
Definition: cxxtm.hpp:40
bool_t TMnet_isPath(TM_ARGDECL net_t *netPtr, long fromId, long toId, bitmap_t *visitedBitmapPtr, queue_t *workQueuePtr)
Definition: net.c:472
net_t* net_alloc |
( |
long |
numNode | ) |
|
void net_applyOperation |
( |
net_t * |
netPtr, |
|
|
operation_t |
op, |
|
|
long |
fromId, |
|
|
long |
toId |
|
) |
| |
void net_free |
( |
net_t * |
netPtr | ) |
|
void net_generateRandomEdges |
( |
net_t * |
netPtr, |
|
|
long |
maxNumParent, |
|
|
long |
percentParent, |
|
|
random_t * |
randomPtr |
|
) |
| |
list_t* net_getChildIdListPtr |
( |
net_t * |
netPtr, |
|
|
long |
id |
|
) |
| |
list_t* net_getParentIdListPtr |
( |
net_t * |
netPtr, |
|
|
long |
id |
|
) |
| |
bool_t net_hasEdge |
( |
net_t * |
netPtr, |
|
|
long |
fromId, |
|
|
long |
toId |
|
) |
| |