Package cha computes the call graph of a Go program using the Class Hierarchy Analysis (CHA) algorithm.

This package provides Rapid Type Analysis (RTA) for Go, a fast algorithm for call graph construction and discovery of reachable code (and hence dead code) and runtime types.

Package static computes the call graph of a Go program containing only static call edges.

AddEdge adds the edge (caller, site, callee) to the call graph.

CalleesOf returns a new set containing all direct callees of the caller node.

GraphVisitEdges visits all the edges in graph g in depth-first order.

New returns a new Graph with the specified root node.

PathSearch finds an arbitrary path starting at node start and ending at some node for which isEnd() returns true.

A Edge represents an edge in the call graph.

A Graph represents a call graph.

A Node represents a node in a call graph.