CS计算机代考程序代写 algorithm /* * * * * * *

/* * * * * * *
* Module containing various graph algorithms.
*
* created for COMP20007 Design of Algorithms 2020
* by Tobias Edwards
*/

#ifndef GRAPHALGS_H
#define GRAPHALGS_H

#include “graph.h”

// Runs a depth first search on the given graph, returning a dynamically
// allocated array of integers representing the order in which the DFS
// visits the nodes in the graph.
//
// The resultant array will be of size n_vertices and must be freed after use.
int *dfs(Graph *graph);

#endif