graph

Index ¶

• Constants
• func AddReversedEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool
• func AllNodes(g Interface, node graph.Node) bool
• func EnsureUnique(g UniqueNodeInitializer, name UniqueName, fn NodeInitializerFunc) graph.Node
• func ExistingDirectEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool
• func GetContainingNode(g Graph, containedNode graph.Node) graph.Node
• func GetTopLevelContainerNode(g Graph, containedNode graph.Node) graph.Node
• func IsFromDifferentNamespace(namespace string, node graph.Node) bool
• func NodesByKind(g Interface, nodes []graph.Node, kinds ...string) [][]graph.Node
• func ReverseExistingDirectEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool
• func ReverseGraphEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool
• type ByID
• • func (m ByID) Len() int
  • func (m ByID) Less(i, j int) bool
  • func (m ByID) Swap(i, j int)
• type ByKey
• • func (m ByKey) Len() int
  • func (m ByKey) Less(i, j int) bool
  • func (m ByKey) Swap(i, j int)
• type ByNodeID
• • func (m ByNodeID) Len() int
  • func (m ByNodeID) Less(i, j int) bool
  • func (m ByNodeID) Swap(i, j int)
• type BySeverity
• • func (m BySeverity) Len() int
  • func (m BySeverity) Less(i, j int) bool
  • func (m BySeverity) Swap(i, j int)
• type Edge
• • func NewEdge(from, to graph.Node, kinds ...string) Edge
• • func (e Edge) DOTAttributes() []dot.Attribute
  • func (e Edge) IsKind(kind string) bool
  • func (e Edge) Kinds() sets.String
• type EdgeFunc
• • func AddGraphEdgesTo(g Interface) EdgeFunc
  • func EdgesOfKind(kinds ...string) EdgeFunc
  • func RemoveInboundEdges(nodes []graph.Node) EdgeFunc
  • func RemoveOutboundEdges(nodes []graph.Node) EdgeFunc
• type ExistenceChecker
• type Graph
• • func New() Graph