nodelist.h File Reference

#include <cgraph/list.h>
#include <render.h>
#include <stddef.h>

Include dependency graph for nodelist.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	appendNodelist (nodelist_t *, size_t, 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 *, Agnode_t *, Agnode_t *, int)
void	reverseAppend (nodelist_t *, nodelist_t *)
	Create l1 @ (rev l2) Destroys and frees l2.

Function Documentation

appendNodelist()

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

extern

Definition at line 18 of file nodelist.c.

References NULL.

Referenced by insertNodelist(), and place_node().

Here is the caller graph for this function:

insertNodelist()

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

extern

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  )

extern

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  )

extern

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: