The CyMeAlg Software (Release 0.01)
|
This header file contains the definition of a weighted directed graph. More...
#include <iostream>
#include <new>
#include <stack>
#include <queue>
#include <set>
#include <memory>
#include <vector>
#include <algorithm>
#include "chomp/system/config.h"
#include "chomp/struct/multitab.h"
#include "chomp/struct/hashsets.h"
#include "chomp/struct/flatmatr.h"
#include "chomp/struct/bitfield.h"
#include "chomp/struct/bitsets.h"
#include "chomp/struct/fibheap.h"
#include "chomp/struct/autoarray.h"
#include "chomp/system/timeused.h"
#include "cymealg/dummyarr.h"
#include "cymealg/dummyrnd.h"
Go to the source code of this file.
Classes | |
class | cymealg::diGraph< wType > |
This class defines a weighted directed graph with very limited number of operations. More... | |
struct | cymealg::diGraph< wType >::edgeTriple |
An edge with a weight (used by the Edmonds algorithm). More... | |
class | cymealg::diGraph< wType >::posWeight |
A class for representing a positive number with negative values serving as the infinity (used in the Dijkstra algorithm). More... | |
Namespaces | |
cymealg | |
Functions | |
template<class wType1 , class wType2 > | |
bool | cymealg::operator== (const diGraph< wType1 > &g1, const diGraph< wType2 > &g2) |
template<class wType1 , class wType2 > | |
bool | cymealg::operator!= (const diGraph< wType1 > &g1, const diGraph< wType2 > &g2) |
This header file contains the definition of a weighted directed graph.
Definition in file digraph.h.