/abstraction/width.h File Reference

#include "graph.h"

Include dependency graph for width.h:

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

Functions
node *	findNodeAt (int x, int y, graph *g)
	Id width.h,v 1.2 2006/09/18 06:22:14 nathanst Exp
edge *	findEdgeBetween (int from, int to, graph *g)
float	findMin (node *n)
	Finds the minimum edge width of all edges from the node.
float	findMax (node *n)
	Finds the maximum edge width of all edges from the node.
float	findMaxAbstracted (node *x, graph *g)
	Finds the maximum edge width of all nodes abstracted by x.
float	findMinAbstractedNode (node *x, graph *g)
	Finds the minimum node width of all nodes abstracted by x.
float	minSpanningTree (node *n, graph *g)
	Finds the minimum edge width in a spanning tree of maximal weight constructed from the edges between the nodes abstracted within n.
bool	edgeInVector (edge *e, std::vector< edge * > edges)
	Returns true if 'e' is in 'edges' (based on it's from and to values), false otherwise.
void	sortEdgeWidths (std::vector< edge * > *edges)
	Sort all the edges in descending order, based on their edge width.
bool	hasCycle (edge *e, std::vector< int > nodes)
	Returns true if adding e will cause a cycle, false otherwise.

---

Function Documentation

bool edgeInVector (  edge *  e, std::vector< edge * >  edges )

Returns true if 'e' is in 'edges' (based on it's from and to values), false otherwise.

edge* findEdgeBetween (  int  from, int  to, graph *  g )

float findMax (  node *  n  )

Finds the maximum edge width of all edges from the node.

float findMaxAbstracted (  node *  x, graph *  g )

Finds the maximum edge width of all nodes abstracted by x.

float findMin (  node *  n  )

Finds the minimum edge width of all edges from the node.

float findMinAbstractedNode (  node *  x, graph *  g )

Finds the minimum node width of all nodes abstracted by x.

node* findNodeAt (  int  x, int  y, graph *  g )

Id width.h,v 1.2 2006/09/18 06:22:14 nathanst Exp This is quite inefficient and should be done in a better way.

bool hasCycle (  edge *  e, std::vector< int >  nodes )

Returns true if adding e will cause a cycle, false otherwise.

float minSpanningTree (  node *  n, graph *  g )

Finds the minimum edge width in a spanning tree of maximal weight constructed from the edges between the nodes abstracted within n. The graph g should be the abstracted graph level one below that of which 'n' is in.

void sortEdgeWidths (  vector< edge * > *  edges  )

Sort all the edges in descending order, based on their edge width. Insertion sort (shouldn't be many values in the vector).

---