NetlistGraph class
#include <netlist/NetlistGraph.hpp>
Represent the netlist connectivity of an elaborated design.
Base classes
-
template<class NodeType, class EdgeType>class DirectedGraph<NetlistNode, NetlistEdge>
Public functions
- auto lookup(std::string_view name) const -> NetlistNode*
- auto filterNodes(NodeKind kind) const -> auto
- auto addEdge(NetlistNode& sourceNode, NetlistNode& targetNode) -> NetlistEdge&
Public variables
Function documentation
NetlistNode* slang::
| Parameters | |
|---|---|
| name | The hierarchical name of the node. |
| Returns | A pointer to the node if found, or nullptr if not found. |
Lookup a node in the graph by its hierarchical name.
auto slang::
| Parameters | |
|---|---|
| kind | The kind of nodes to filter. |
| Returns | A view of nodes matching the specified kind. |
Return a view of all nodes of the specified kind.
NetlistEdge& slang::
Add an edge between two nodes, bypassing DirectedGraph::