DeSiGNAR  0.5a
Data Structures General Library
Public Member Functions | List of all members
Designar::ArcHeap< GT, Distance, Cmp > Class Template Reference

#include <graphalgorithms.H>

Inheritance diagram for Designar::ArcHeap< GT, Distance, Cmp >:
Inheritance graph
[legend]
Collaboration diagram for Designar::ArcHeap< GT, Distance, Cmp >:
Collaboration graph
[legend]

Public Member Functions

void insert_arc (Arc< GT > *a, Node< GT > *t)
 
Arc< GT > * get_min_arc ()
 
- Public Member Functions inherited from Designar::LHeap< Arc< GT > *, ArcHeapCmp< GT, Distance, Cmp > >
void remove (Arc< GT > *&item)
 
 LHeap (ArcHeapCmp< GT, Distance, Cmp > &_cmp)
 
 LHeap (ArcHeapCmp< GT, Distance, Cmp > &&_cmp=ArcHeapCmp< GT, Distance, Cmp >())
 
 LHeap (LHeap &&h)
 
 ~LHeap ()
 
LHeapoperator= (LHeap &&h)
 
void swap (LHeap &h)
 
ArcHeapCmp< GT, Distance, Cmp > & get_cmp ()
 
const ArcHeapCmp< GT, Distance, Cmp > & get_cmp () const
 
void clear ()
 
nat_t size () const
 
bool is_empty () const
 
const Arc< GT > *& insert (const Arc< GT > *&k)
 
const Arc< GT > *& insert (Arc< GT > *&&k)
 
const Arc< GT > *& top () const
 
Arc< GT > * get ()
 

Additional Inherited Members

- Public Types inherited from Designar::LHeap< Arc< GT > *, ArcHeapCmp< GT, Distance, Cmp > >
using ItemType = Arc< GT > *
 
using KeyType = Arc< GT > *
 
using DataType = Arc< GT > *
 
using ValueType = Arc< GT > *
 
using SizeType = nat_t
 
using CmpType = ArcHeapCmp< GT, Distance, Cmp >
 

Member Function Documentation

template<class GT, class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
Arc<GT>* Designar::ArcHeap< GT, Distance, Cmp >::get_min_arc ( )
inline
template<class GT, class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
void Designar::ArcHeap< GT, Distance, Cmp >::insert_arc ( Arc< GT > *  a,
Node< GT > *  t 
)
inline

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