GraphAdjList.h File Reference

#include <stdexcept>
#include <sstream>
#include <unordered_map>
#include <JSONutil.h>
#include "SLelement.h"
#include "Edge.h"

Go to the source code of this file.

Classes
class	bridges::datastructure::GraphAdjList< K, E1, E2 >
	This class provides methods to represent adjacency list based graphs. More...
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::KeySet_helper
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::KeySet_helper::const_iterator
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper
	This is a helper class to return sets of vertices in a way that are iterable with range for loops. Students should have to use this directly. More...
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator
	This is a helper class to return sets of vertices in a way that are iterable with range for loops. Students should have to use this directly. More...
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::const_iterator
	This is a helper class to return sets of vertices in a way that are iterable with range for loops. Students should have to use this directly. More...
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::constVertexElementSet_listhelper
	This is a helper class to return sets of vertices in a way that are iterable with range for loops. Students should not have to use this directly. More...
class	bridges::datastructure::GraphAdjList< K, E1, E2 >::constVertexElementSet_listhelper::const_iterator
	This is a helper class to return sets of vertices ina way that are iterable with range for loops. Students should not have to use this directly. More...

Namespaces
	bridges
	these methods convert byte arrays in to base64 codes and are used in BRIDGES to represent the color arrays as strings. The code is adapted from external sources detailed below.
	bridges::datastructure