If the input graph does not contain node category information, emit a warning
message and proceed loading the graph, instead of failing.
Reviewed-by: neliasso, chagedorn, thartmann
Replace backward traversal in the IGV block formation algorithm by forward
traversal guided by node category information. This change addresses the
reported assertion failures, places block projection nodes together with their
predecessors, and gives a more natural block numbering.
Reviewed-by: chagedorn, neliasso
Add filters to color and hide parts of the graph based on node categories or
estimated execution frequency, and simplify remaining filters.
Co-authored-by: Christian Hagedorn <chagedorn@openjdk.org>
Reviewed-by: vlivanov, chagedorn, thartmann
Allow users to search by node id or name by default, show partial matches when
searching for a specific property, show 'All N matching nodes' entry only if
relevant, and rank results by level of matching.
Co-authored-by: Christian Hagedorn <chagedorn@openjdk.org>
Reviewed-by: chagedorn, vlivanov, xliu
