Description: Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum
To Search:
- [Graph] - The realization of the use of adjacency
- [RoughSet] - Can be embedded in the rough set classif
- [patterndesign] - pattern design
- [ma_bu_tu] - Written in C language with Bu map relati
- [findH] - Using branch and bound method to achieve
- [Graph] - 1. The establishment of the network adja
File list (Check if you may need any files):
Graph.h
graphDef.cpp
greedy.cc
Queue.cpp
Queue.h
Stack.cpp
Stack.h
stdafx.cpp
stdafx.h
targetver.h
Download