graph

package

v0.0.0-...-0925704 Latest Latest Go to latest Published: Oct 5, 2023 License: MIT Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

func RoadsAndLibraries(numCities int32, libCost int32, roadCost int32, roads [][]int32) int64

type ComponentsInGraphSets struct {
	// contains filtered or unexported fields
}

type PqItem struct {
	// contains filtered or unexported fields
}

type PriorityQueue []*PqItem

func (pq PriorityQueue) IsEmpty() bool

func (pq PriorityQueue) Len() int

func (pq PriorityQueue) Less(i, j int) bool

func (pq *PriorityQueue) Pop() any

func (pq *PriorityQueue) Push(x any)

func (pq PriorityQueue) Swap(i, j int)

type ReallySpecialSubtreeEdge struct {
	// contains filtered or unexported fields
}

type ReallySpeciallSubtreeGraph struct {
	// contains filtered or unexported fields
}

type ReallySpeciallSubtreeSet struct {
	// contains filtered or unexported fields
}

Disjoint Set - auxiliary datastructure

type RoadsAndLibrariesGraph struct {
	// contains filtered or unexported fields
}

func NewRoadsAndLibrariesGraph(n int32, roads [][]int32) *RoadsAndLibrariesGraph

type SnakesAndLaddersEdge struct {
	// contains filtered or unexported fields
}

type SnakesAndLaddersGraph struct {
	// contains filtered or unexported fields
}

type SnakesAndLaddersNode struct {
	// contains filtered or unexported fields
}

type SnakesAndLaddersQueue struct {
	// contains filtered or unexported fields
}

type SnakesAndLaddersQueueEntry struct {
	// contains filtered or unexported fields
}

type SpecialTreeEdge struct {
	// contains filtered or unexported fields
}

type SpecialTreeGraph struct {
	// contains filtered or unexported fields
}

type SpecialTreeNode struct {
	// contains filtered or unexported fields
}