Graph Drawing Toolkit

An object-oriented C++ library for handling and drawing graphs

---

gdt::gdtnode_pq< P > Class Template Reference

#include <gdtnode_pq.h>

Inheritance diagram for gdt::gdtnode_pq< P >:

[legend]

Collaboration diagram for gdt::gdtnode_pq< P >:

[legend]

List of all members.

Public Member Functions
	gdtnode_pq (const undi_graph &_g)
	~gdtnode_pq ()
void	insert (gdtnode v, const P &p)
const P &	prio (gdtnode v) const
bool	member (gdtnode v) const
void	decrease_p (gdtnode v, const P &p)
gdtnode	find_min () const
void	del (gdtnode v)
gdtnode	del_min ()
void	get_nodes (gdtlist< gdtnode > &l)
void	clear ()
const P &	inf (gdtnode v) const
void	decrease_inf (gdtnode v, const P &x)

---

Detailed Description

template<class P>
class gdt::gdtnode_pq< P >

Definition at line 12 of file gdtnode_pq.h.

---

Constructor & Destructor Documentation

template<class P>

gdt::gdtnode_pq< P >::gdtnode_pq

(

const undi_graph &

_g

)

[inline]

Definition at line 20 of file gdtnode_pq.h.

template<class P>

gdt::gdtnode_pq< P >::~gdtnode_pq

(

)

[inline]

Definition at line 22 of file gdtnode_pq.h.

---

Member Function Documentation

template<class P>

void gdt::gdtnode_pq< P >::insert	(	gdtnode	v,
		const P &	p
	)			[inline]

Definition at line 24 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::insert().

Here is the call graph for this function:

template<class P>

const P& gdt::gdtnode_pq< P >::prio

(

gdtnode

v

)

const [inline]

Definition at line 29 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::prio().

Here is the call graph for this function:

template<class P>

bool gdt::gdtnode_pq< P >::member

(

gdtnode

v

)

const [inline]

Definition at line 31 of file gdtnode_pq.h.

References NULL.

template<class P>

void gdt::gdtnode_pq< P >::decrease_p	(	gdtnode	v,
		const P &	p
	)			[inline]

Definition at line 33 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::decrease_p().

Here is the call graph for this function:

template<class P>

gdtnode gdt::gdtnode_pq< P >::find_min

(

)

const [inline]

Reimplemented from gdt::gdtp_queue< P, I, less >.

Definition at line 35 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::find_min(), and gdt::gdtp_queue< P, I, less >::inf().

Referenced by gdt::gdtnode_pq< P >::del_min().

Here is the call graph for this function:

Here is the caller graph for this function:

template<class P>

void gdt::gdtnode_pq< P >::del

(

gdtnode

v

)

[inline]

Definition at line 37 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::del_item().

Here is the call graph for this function:

template<class P>

gdtnode gdt::gdtnode_pq< P >::del_min

(

)

[inline]

Reimplemented from gdt::gdtp_queue< P, I, less >.

Definition at line 42 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::del_min(), and gdt::gdtnode_pq< P >::find_min().

Here is the call graph for this function:

template<class P>

void gdt::gdtnode_pq< P >::get_nodes

(

gdtlist< gdtnode > &

l

)

[inline]

Definition at line 49 of file gdtnode_pq.h.

References gdt::gdtlist< E >::append(), gdt::gdtlist< E >::clear(), forall_items, and gdt::gdtp_queue< P, I, less >::inf().

Here is the call graph for this function:

template<class P>

void gdt::gdtnode_pq< P >::clear

(

)

[inline]

Definition at line 59 of file gdtnode_pq.h.

template<class P>

const P& gdt::gdtnode_pq< P >::inf

(

gdtnode

v

)

const [inline]

Definition at line 64 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::prio().

Here is the call graph for this function:

template<class P>

void gdt::gdtnode_pq< P >::decrease_inf	(	gdtnode	v,
		const P &	x
	)			[inline]

Definition at line 68 of file gdtnode_pq.h.

References gdt::gdtp_queue< P, I, less >::decrease_p().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• gdtnode_pq.h

---