graph

Documentation

Index

• Constants
• type Edge
• type Graph
  • func BuildGraph(rideCSV string, walkCSV string, idCSV string) Graph
  • func (g *Graph) Traversal(startTime int) ([]*Node, int)
  • func (g *Graph) TraversalGo(startTime int) ([]*Node, int)
• type Node
  • func New(idx int, name string, size int) *Node

Constants

const (
	MAX_INT = int(^uint(0) >> 1)
)

Types

type Edge

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

type Graph

type Graph struct {
	Nodes []*Node
}

func BuildGraph

func BuildGraph(rideCSV string, walkCSV string, idCSV string) Graph

func (*Graph) Traversal

func (g *Graph) Traversal(startTime int) ([]*Node, int)

Dijkstra's algorithm traversal of graph

func (*Graph) TraversalGo

func (g *Graph) TraversalGo(startTime int) ([]*Node, int)

type Node

type Node struct {
	Index     int
	Name      string
	WaitTimes []int
	Edges     []*Edge
	// contains filtered or unexported fields
}

func New

func New(idx int, name string, size int) *Node