P.I.G.A.L.E.
1.3.9
Public Implementation of a Graph Algorithm
Library and Editor
H. de Fraysseix      P. Ossona de Mendez

---

ChannelRouter Class Reference

Collaboration diagram for ChannelRouter:

[legend]

List of all members.

Public Member Functions

• ChannelRouter (int n, int min_v, int max_v)
• void clear ()
• void insert (int s, int from, int to)
• int solve (svector< int > &channel)

Private Attributes

• int nseg
• int minv
• int maxv
• int nchannel
• int nfree
• svector< int > top
• svector< int > link
• svector< int > end
• svector< int > topendc
• svector< int > linkendc
• svector< bool > free

---

Constructor & Destructor Documentation

ChannelRouter	(	int	n,
		int	min_v,
		int	max_v
	)			[inline]

---

Member Function Documentation

void clear

(

)

[inline]

void insert	(	int	s,
		int	from,
		int	to
	)			[inline]

int solve

(

svector< int > &

channel

)

[inline]

---

Member Data Documentation

int nseg [private]

int minv [private]

int maxv [private]

int nchannel [private]

int nfree [private]

svector<int> top [private]

svector<int> link [private]

svector<int> end [private]

svector<int> topendc [private]

svector<int> linkendc [private]

svector<bool> free [private]

---