Crossings Minimization  1.0
priority_edges.h File Reference

Functions for setting up priority edges and retrieving the number of crossings involving them. More...

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

Go to the source code of this file.

Functions

void initPriorityEdges (void)
 
void freePriorityEdges (void)
 
void addToPriorityEdges (Edgeptr edge)
 
int numberOfFavoredEdges (void)
 
const EdgeptrfavoredEdges (void)
 
int priorityEdgeCrossings (void)
 
void createFanoutList (Nodeptr node)
 Takes all the edges that are accessible via a path from the node and adds them to the priority list. More...
 
void createFavoredEdgeInfo (char *file_name_buffer, char *graph_name_buffer, char *comment_buffer)
 

Detailed Description

Functions for setting up priority edges and retrieving the number of crossings involving them.

Author
Matthias Stallmann
Date
April, 2011
Id
priority_edges.h 2 2011-06-07 19:50:41Z mfms

Definition in file priority_edges.h.

Function Documentation

◆ addToPriorityEdges()

void addToPriorityEdges ( Edgeptr  edge)
Parameters
edgethe edge to be added to the list of priority edges

Definition at line 41 of file priority_edges.c.

References CAPACITY_INCREMENT, number_of_priority_edges, and priority_edge_list_capacity.

Referenced by downDFS(), and upDFS().

◆ createFanoutList()

void createFanoutList ( Nodeptr  node)

Takes all the edges that are accessible via a path from the node and adds them to the priority list.

Definition at line 104 of file priority_edges.c.

References clearFixedNodes(), downDFS(), and upDFS().

Referenced by main().

Here is the call graph for this function:

◆ createFavoredEdgeInfo()

void createFavoredEdgeInfo ( char *  file_name_buffer,
char *  graph_name_buffer,
char *  comment_buffer 
)
Parameters
file_name_bufferstorage for the file name for the favored edges
graph_name_bufferstorage for the graph name for the favored edges
commentsin the favored edge file, if any
Todo:
put more information into the graph name and/or comments; also, most graph names have characters such as - and + in them; these must be converted to _'s

Definition at line 112 of file priority_edges.c.

References createDotFileName(), and graph_name.

Referenced by main().

Here is the call graph for this function:

◆ favoredEdges()

const Edgeptr* favoredEdges ( void  )
Returns
(a pointer to) the array of favored edges

Definition at line 56 of file priority_edges.c.

References priority_edge_list.

Referenced by main().

◆ freePriorityEdges()

void freePriorityEdges ( void  )

deallocates priority edge list

Definition at line 34 of file priority_edges.c.

References number_of_priority_edges.

◆ initPriorityEdges()

void initPriorityEdges ( void  )

Initializes list of priority edges

Definition at line 27 of file priority_edges.c.

References CAPACITY_INCREMENT, number_of_priority_edges, and priority_edge_list_capacity.

Referenced by main().

◆ numberOfFavoredEdges()

int numberOfFavoredEdges ( void  )
Returns
the number of priority (favored) edges

Definition at line 51 of file priority_edges.c.

References number_of_priority_edges.

Referenced by main().

◆ priorityEdgeCrossings()

int priorityEdgeCrossings ( void  )
Returns
the number of crossings involving priority edges

Definition at line 61 of file priority_edges.c.

References number_of_priority_edges, and total_crossings.

Referenced by capture_beginning_stats(), capture_preprocessing_stats(), and update_best_all().