algorithms

package

v0.0.0-...-abf69a9 Latest Latest Go to latest Published: Dec 26, 2024 License: MIT Imports: 7 Imported by: 0

Details

This section is empty.

This section is empty.

func DpSequenceArrangements(sequence string, pieces []string) [][]string

func DpSequenceArrangementsCount(sequence string, pieces []string) int

func DpSequenceCheck(sequence string, pieces []string) bool

dpSequenceCheck uses dynamic programming to check if the passed `sequence` can be constructed with the `pieces` passed.

func FindMazePath(mat matrix.Matrix, start point.Point, end point.Point, wallValue int) (int, [][]point.Point)

func FloodFill(mat matrix.Matrix, start point.Point) []point.Point

func LargestClique(graph map[string]set.Set) set.Set

type Corner struct {
	point.Point
	CornerType CornerType
}

func GetCorners(mat matrix.Matrix, region []point.Point) []Corner

ConvexTL - corner on bottom right A ?B BA

ConcaveTL - corner on bottom right A BA AA

type CornerType int

const (
	ConvexTL CornerType = iota
	ConvexTR
	ConvexBL
	ConvexBR
	ConcaveTL
	ConcaveTR
	ConcaveBL
	ConcaveBR
)