DgmlGraph
Namespace: Dotsider.Core.Analysis.Models
Assembly: Dotsider.Core.dll
An ILC dependency graph read from a DGML file, with the reverse index needed to answer “why is this in my binary”: a breadth-first walk from any node toward its dependers ends at a root — a node nothing depends on — and the chain back down is the explanation.
public sealed class DgmlGraphInheritance
Section titled “Inheritance”Object → DgmlGraph
Properties
Section titled “Properties”The graph’s edges; each source depends on its target.
Returns: IReadOnlyList<DgmlLink>
public IReadOnlyList<DgmlLink> Links { get; }The graph’s nodes.
Returns: IReadOnlyList<DgmlNode>
public IReadOnlyList<DgmlNode> Nodes { get; }Methods
Section titled “Methods”FindNodeByLabel(string)
Section titled “FindNodeByLabel(string)”Finds the node with the given label, or null when no node carries it. When labels repeat, the first node wins.
Parameters:
label(String): The node name to look up — for an mstat entry, itsNodeName.
Returns: DgmlNode
public DgmlNode? FindNodeByLabel(string label)PathToRoot(int)
Section titled “PathToRoot(int)”Walks from the node to a root and returns the chain root-first, ending at the queried node. Empty when the id is unknown.
Parameters:
nodeId(Int32): The node id to explain.
Returns: IReadOnlyList<DgmlPathStep>
public IReadOnlyList<DgmlPathStep> PathToRoot(int nodeId)PathToRoot(string)
Section titled “PathToRoot(string)”Walks from the labeled node to a root and returns the chain root-first, ending at the queried node. Empty when the label is unknown.
Parameters:
label(String): The node name to explain.
Returns: IReadOnlyList<DgmlPathStep>
public IReadOnlyList<DgmlPathStep> PathToRoot(string label)