// Copyright Epic Games, Inc. All Rights Reserved.

#pragma once

#include "CoreMinimal.h"

namespace Audio
{
	/** A pair of int32s represent a directed edge. The first value represents 
	 * the source vertex, and the second value represents the destination 
	 * vertex.
	 */
	typedef TTuple<int32, int32> FDirectedEdge;

	/** A strongly connected component contains a subgraph of strongly connected
	 * vertices and their corresponding edges.
	 */
	struct FStronglyConnectedComponent
	{
		/** Vertices in the strongly connected component. */
		TArray<int32> Vertices;

		/** Edges in the strongly connected component. */
		TArray<FDirectedEdge> Edges;
	};

	/** An element in a directed tree with references to children of a vertex. */
	struct FDirectedTreeElement
	{
		TArray<int32> Children;
	};

	/** A directed tree graph represenation. */
	typedef TMap<int32, FDirectedTreeElement> FDirectedTree;


	struct SIGNALPROCESSING_API FDirectedGraphAlgo
	{
		/** Build a directed tree from an array of edges.
		 *
		 * @parma InEdges - An array of directed eges.
		 * @param OutTree - A tree structure built from the edges.
		 */
		static void BuildDirectedTree(TArrayView<const FDirectedEdge> InEdges, FDirectedTree& OutTree);

		/** Build a transpose directed tree from an array of edges. 
		 *
		 * The transpose of a directed graph is created by reversing each edge.
		 *
		 * @parma InEdges - An array of directed eges.
		 * @param OutTree - A tree structure built from the reversed edges.
		 */
		static void BuildTransposeDirectedTree(TArrayView<const FDirectedEdge> InEdges, FDirectedTree& OutTree);

		/** Traverse a tree in a depth first ordering.
		 *
		 * @param InInitialVertex - The starting vertex for traversal.
		 * @param InTree          - The tree structure to traverse. 
		 * @param InVisitFunc     - A function that is called for each vertex that 
		 *                          is visited. If this function returns true, 
		 *                          traversal is continued in a depth first 
		 *                          manner. If this function returns false, the 
		 *                          children of the current vertex are not visited.
		 */
		static void DepthFirstTraversal(int32 InInitialVertex, const FDirectedTree& InTree, TFunctionRef<bool (int32)> InVisitFunc);

		/** Traverse a tree in a breadth first ordering.
		 *
		 * @param InInitialVertex - The starting vertex for traversal.
		 * @param InTree          - The tree structure to traverse. 
		 * @param InVisitFunc     - A function that is called for each vertex that 
		 *                          is visited. If this function returns true, 
		 *                          the children of this vertex will be visited 
		 *                          in the future.  If this function returns false, 
		 *                          then the children of the current vertex will 
		 *                          not be visited.
		 */
		static void BreadthFirstTraversal(int32 InInitialVertex, const FDirectedTree& InTree, TFunctionRef<bool (int32)> InVisitFunc);

		/** Sort vertices topologically using a depth first sorting algorithm.
		 *
		 * @param InUniqueVertices - An array of vertices to sort.
		 * @param InUniqueEdges - An array of edges describing dependencies.
		 * @param OutVertexOrder - An array where ordered vertices are placed.
		 *
		 * @return True if sorting was successful. False otherwise.
		 */
		static bool DepthFirstTopologicalSort(TArrayView<const int32> InUniqueVertices, TArrayView<const FDirectedEdge> InUniqueEdges, TArray<int32>& OutVertexOrder);

		/** Sort vertices topologically using a Kahn's sorting algorithm.
		 *
		 * @param InUniqueVertices - An array of vertices to sort.
		 * @param InUniqueEdges - An array of edges describing dependencies.
		 * @param OutVertexOrder - An array where ordered vertices are placed.
		 *
		 * @return True if sorting was successful. False otherwise.
		 */
		static bool KahnTopologicalSort(TArrayView<const int32> InUniqueVertices, TArrayView<const FDirectedEdge> InUniqueEdges, TArray<int32>& OutVertexOrder);


		/** Find strongly connected components given a set of edges using Tarjan
		 * algorithm.
		 *
		 * @param InEdges - Edges in the directed graph.
		 * @param OutComponents - Strongly connected components found in the graph are be added to this array.
		 * @param bExcludeSingleVertex - If true, single vertices are not be returned as strongly connected components. If false, single vertices may be returned as strongly connected components. 
		 *
		 * @return True if one or more strongly connected components are added to OutComponents. False otherwise. 
		 */
		static bool TarjanStronglyConnectedComponents(const TSet<FDirectedEdge>& InEdges, TArray<FStronglyConnectedComponent>& OutComponents, bool bExcludeSingleVertex = true);
	};
}