slang::netlist::PathFinder class

#include <netlist/PathFinder.hpp>

Find a path between two points in a netlist.

This class uses a depth-first search to find a path between two nodes in the netlist graph. It constructs a traversal map that captures the parent-child relationships between nodes, allowing it to reconstruct the path from the end node back to the start node.

Constructors, destructors, conversion operators

PathFinder(NetlistGraph const& netlist)

Public functions

auto find(NetlistNode& startNode, NetlistNode& endNode) -> NetlistPath

Function documentation

NetlistPath slang::netlist::PathFinder::find(NetlistNode& startNode, NetlistNode& endNode)

Find a path between two nodes in the netlist. Return a NetlistPath object that is empty if the path does not exist.