sgraph.h File Reference

#include <ortho/structures.h>
#include <stdbool.h>

Include dependency graph for sgraph.h:

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

Go to the source code of this file.

Data Structures
struct	snode
	a node of search graph sgraph, is created as a border segment between two adjusted cells of type cell. More...
struct	sedge
struct	sgraph

Typedefs
typedef struct snode	snode
typedef struct sedge	sedge

Functions
void	reset (sgraph *)
void	gsave (sgraph *)
sgraph *	createSGraph (int)
void	freeSGraph (sgraph *)
void	initSEdges (sgraph *g, int maxdeg)
int	shortPath (sgraph *g, snode *from, snode *to)
snode *	createSNode (sgraph *)
sedge *	createSEdge (sgraph *g, snode *v0, snode *v1, double wt)

Typedef Documentation

sedge

typedef struct sedge sedge

Definition at line 18 of file sgraph.h.

snode

typedef struct snode snode

Definition at line 17 of file sgraph.h.

Function Documentation

createSEdge()

sedge * createSEdge ( sgraph *  g, snode *  v0, snode *  v1, double  wt  )

extern

Definition at line 84 of file sgraph.c.

References addEdgeToNode(), sedge::cnt, sgraph::edges, snode::index, sgraph::nedges, sedge::v1, sedge::v2, and sedge::weight.

Referenced by addLoop(), addNodeEdges(), and createSEdges().

Here is the call graph for this function:

Here is the caller graph for this function:

createSGraph()

sgraph * createSGraph ( int  nnodes )

extern

Definition at line 57 of file sgraph.c.

References gv_alloc(), gv_calloc(), sgraph::nnodes, and sgraph::nodes.

Referenced by mkMazeGraph().

Here is the call graph for this function:

Here is the caller graph for this function:

createSNode()

snode * createSNode ( sgraph *  g )

extern

Definition at line 68 of file sgraph.c.

References snode::index, sgraph::nnodes, and sgraph::nodes.

Referenced by findSVert().

Here is the caller graph for this function:

freeSGraph()

void freeSGraph ( sgraph *  g )

extern

Definition at line 102 of file sgraph.c.

References snode::adj_edge_list, sgraph::edges, free(), and sgraph::nodes.

Referenced by freeMaze().

Here is the call graph for this function:

Here is the caller graph for this function:

gsave()

void gsave ( sgraph *  G )

extern

Definition at line 19 of file sgraph.c.

References G.

Referenced by mkMazeGraph().

Here is the caller graph for this function:

initSEdges()

void initSEdges ( sgraph *  g, int  maxdeg  )

extern

Definition at line 41 of file sgraph.c.

References snode::adj_edge_list, sgraph::edges, gv_calloc(), sgraph::nnodes, and sgraph::nodes.

Referenced by mkMazeGraph().

Here is the call graph for this function:

Here is the caller graph for this function:

reset()

void reset ( sgraph *  G )

extern

Definition at line 29 of file sgraph.c.

References G.

Referenced by fdp_tLayout(), flat_edges(), and orthoEdges().

Here is the caller graph for this function:

shortPath()

int shortPath ( sgraph *  g, snode *  from, snode *  to  )

extern

Definition at line 143 of file sgraph.c.

References snode::adj_edge_list, adjacentNode(), E_WT, sgraph::edges, snode::index, snode::n_adj, N_DAD, N_EDGE, N_VAL, sgraph::nnodes, sgraph::nodes, NULL, PQ_insert(), PQinit(), PQremove(), PQupdate(), and UNSEEN.

Referenced by orthoEdges().

Here is the call graph for this function:

Here is the caller graph for this function: