doxygen/lab_graphs/graph__tools_8h_source.html

 #ifndef _GRAPH_TOOLS_

 #define _GRAPH_TOOLS_


 #include <algorithm>

 #include <stack>

 #include <queue>

 #include <unordered_map>

 #include "graph.h"

 #include "dsets.h"


 using std::stack;

 using std::queue;

 using std::unordered_map;


 namespace GraphTools

 {

     int findMinWeight(Graph & graph);


     int findShortestPath(Graph & graph, Vertex start, Vertex end);


     void findMST(Graph & graph);


     // define any helper functions here:


     Edge BFS(Graph & graph, Vertex start);

 }


 #endif

Graph
Represents a graph of vertices and edges and allows basic operations to be performed on it...
Definition: graph.h:49

GraphTools::findMST
void findMST(Graph &graph)
Finds a minimal spanning tree on a graph.
Definition: graph_tools.cpp:127

GraphTools
This is a namespace that provides various functions for operations on the Graph class.
Definition: graph_tools.h:25

Edge
Represents an edge in a graph; used by the Graph class.
Definition: edge.h:22

GraphTools::findMinWeight
int findMinWeight(Graph &graph)
Finds the minimum edge weight in the Graph g.
Definition: graph_tools.cpp:26

GraphTools::BFS
Edge BFS(Graph &graph, Vertex start)
Does a BFS of a graph, keeping track of the minimum weight edge seen so far.
Definition: graph_tools.cpp:173

graph.h
Graph Library Declarations.

GraphTools::findShortestPath
int findShortestPath(Graph &graph, Vertex start, Vertex end)
Returns the shortest distance (in edges) between the Vertices start and end.
Definition: graph_tools.cpp:62