Graphviz 12.0.1~dev.20240716.0800
Loading...
Searching...
No Matches
nodelist.c File Reference
#include <circogen/nodelist.h>
#include <circogen/circular.h>
#include <assert.h>
#include <limits.h>
#include <stddef.h>
#include <string.h>
Include dependency graph for nodelist.c:

Go to the source code of this file.

Functions

void appendNodelist (nodelist_t *list, size_t one, Agnode_t *n)
 Add node after one.
 
void realignNodelist (nodelist_t *list, size_t np)
 Make np new front of list, with current last hooked to current first.
 
void insertNodelist (nodelist_t *list, Agnode_t *cn, Agnode_t *neighbor, int pos)
 
static void concatNodelist (nodelist_t *l1, nodelist_t *l2)
 attach l2 to l1.
 
void reverseAppend (nodelist_t *l1, nodelist_t *l2)
 Create l1 @ (rev l2) Destroys and frees l2.
 

Function Documentation

◆ appendNodelist()

void appendNodelist ( nodelist_t *  list,
size_t  one,
Agnode_t n 
)

Definition at line 18 of file nodelist.c.

References NULL.

Referenced by insertNodelist(), and place_node().

Here is the caller graph for this function:

◆ concatNodelist()

static void concatNodelist ( nodelist_t *  l1,
nodelist_t *  l2 
)
static

Definition at line 72 of file nodelist.c.

Referenced by reverseAppend().

Here is the caller graph for this function:

◆ insertNodelist()

void insertNodelist ( nodelist_t *  list,
Agnode_t cn,
Agnode_t neighbor,
int  pos 
)

Remove cn. Then, insert cn before neighbor if pos == 0 and after neighbor otherwise.

Definition at line 48 of file nodelist.c.

References appendNodelist(), neighbor, and NULL.

Referenced by reduce().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ realignNodelist()

void realignNodelist ( nodelist_t *  list,
size_t  np 
)

Definition at line 34 of file nodelist.c.

References NULL.

Referenced by layout_block().

Here is the caller graph for this function:

◆ reverseAppend()

void reverseAppend ( nodelist_t *  l1,
nodelist_t *  l2 
)

Definition at line 79 of file nodelist.c.

References concatNodelist().

Referenced by find_longest_path().

Here is the call graph for this function:
Here is the caller graph for this function: