HOG2
|
#include <limits.h>
#include <vector>
#include <list>
#include <iostream>
#include <stdio.h>
Go to the source code of this file.
Classes | |
union | labelValue |
class | graph_object |
Parent class for nodes and edges allowing them to be stored in a Heap or manipulated with other data structures. More... | |
class | Graph |
A generic Graph class. More... | |
class | edge |
Edge class for connections between node in a Graph. More... | |
class | node |
Nodes to be stored within a Graph. More... | |
Macros | |
#define | MAXINT INT_MAX |
Typedefs | |
typedef std::vector< edge * >::const_iterator | edge_iterator |
typedef std::vector< node * >::const_iterator | node_iterator |
typedef unsigned int | neighbor_iterator |
Enumerations | |
enum | { kEdgeWeight = 0 } |
Definitions for edge labels. More... | |
Functions | |
std::ostream & | operator<< (std::ostream &out, const graph_object &_Obj) |
std::ostream & | operator<< (std::ostream &out, const Graph &_Graph) |
std::ostream & | operator<< (std::ostream &out, const node &_Node) |
std::ostream & | operator<< (std::ostream &out, const edge &_Edge) |
typedef std::vector<edge *>::const_iterator edge_iterator |
typedef unsigned int neighbor_iterator |
typedef std::vector<node *>::const_iterator node_iterator |
anonymous enum |
std::ostream& operator<< | ( | std::ostream & | out, |
const edge & | _Edge | ||
) |
std::ostream& operator<< | ( | std::ostream & | out, |
const Graph & | _Graph | ||
) |
std::ostream& operator<< | ( | std::ostream & | out, |
const graph_object & | _Obj | ||
) |
std::ostream& operator<< | ( | std::ostream & | out, |
const node & | _Node | ||
) |