visualize

Documentation

Index

• func ToGraphViz(g *core.CompiledWorkflow) string
• func TopologicalSort(g v1alpha1.ExecutableWorkflow) ([]v1alpha1.ExecutableNode, error)
• func WorkflowToGraphViz(g *v1alpha1.FlyteWorkflow) string
• type NodeQ
  • func NewNodeNameQ(items ...v1alpha1.NodeID) NodeQ
  • func (s *NodeQ) Deque() v1alpha1.NodeID
  • func (s *NodeQ) Enqueue(items ...v1alpha1.NodeID)
  • func (s NodeQ) HasNext() bool
  • func (s *NodeQ) Peek() v1alpha1.NodeID
  • func (s NodeQ) Remaining() int
• type NodeVisitor
  • func NewNodeVisitor(nodes []v1alpha1.NodeID) NodeVisitor
• type VisitStatus

Functions

func ToGraphViz

func ToGraphViz(g *core.CompiledWorkflow) string

func TopologicalSort

func TopologicalSort(g v1alpha1.ExecutableWorkflow) ([]v1alpha1.ExecutableNode, error)

func WorkflowToGraphViz

func WorkflowToGraphViz(g *v1alpha1.FlyteWorkflow) string

Returns GraphViz https://www.graphviz.org/ representation of the current state of the state machine.

Types

type NodeQ

type NodeQ []v1alpha1.NodeID

func NewNodeNameQ

func NewNodeNameQ(items ...v1alpha1.NodeID) NodeQ

func (*NodeQ) Deque

func (s *NodeQ) Deque() v1alpha1.NodeID

func (*NodeQ) Enqueue

func (s *NodeQ) Enqueue(items ...v1alpha1.NodeID)

func (NodeQ) HasNext

func (s NodeQ) HasNext() bool

func (*NodeQ) Peek

func (s *NodeQ) Peek() v1alpha1.NodeID

func (NodeQ) Remaining

func (s NodeQ) Remaining() int

type NodeVisitor

type NodeVisitor map[v1alpha1.NodeID]VisitStatus

func NewNodeVisitor

func NewNodeVisitor(nodes []v1alpha1.NodeID) NodeVisitor

type VisitStatus

type VisitStatus int8

const (
	NotVisited VisitStatus = iota
	Visited
	Completed
)