HOG2
Classes | Macros | Typedefs | Enumerations | Functions
Graph.h File Reference
#include <limits.h>
#include <vector>
#include <list>
#include <iostream>
#include <stdio.h>
Include dependency graph for Graph.h:
This graph shows which files directly or indirectly include this file:

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)
 

Macro Definition Documentation

◆ MAXINT

#define MAXINT   INT_MAX

Definition at line 24 of file Graph.h.

Typedef Documentation

◆ edge_iterator

typedef std::vector<edge *>::const_iterator edge_iterator

Definition at line 30 of file Graph.h.

◆ neighbor_iterator

typedef unsigned int neighbor_iterator

Definition at line 34 of file Graph.h.

◆ node_iterator

typedef std::vector<node *>::const_iterator node_iterator

Definition at line 33 of file Graph.h.

Enumeration Type Documentation

◆ anonymous enum

anonymous enum

Definitions for edge labels.

Enumerator
kEdgeWeight 

Definition at line 39 of file Graph.h.

Function Documentation

◆ operator<<() [1/4]

std::ostream& operator<< ( std::ostream &  out,
const edge _Edge 
)

◆ operator<<() [2/4]

std::ostream& operator<< ( std::ostream &  out,
const Graph _Graph 
)

◆ operator<<() [3/4]

std::ostream& operator<< ( std::ostream &  out,
const graph_object _Obj 
)

◆ operator<<() [4/4]

std::ostream& operator<< ( std::ostream &  out,
const node _Node 
)