mirror of
https://github.com/NationalSecurityAgency/ghidra.git
synced 2025-10-06 03:50:02 +02:00
GP-256 - Graphing - fixed AST graph exceptions
This commit is contained in:
parent
7764f965be
commit
edc8efdbf6
7 changed files with 51 additions and 31 deletions
|
@ -770,7 +770,6 @@ public class DefaultGraphDisplay implements GraphDisplay {
|
|||
}
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* set the {@link AttributedGraph} for visualization
|
||||
* @param attributedGraph the {@link AttributedGraph} to visualize
|
||||
|
@ -784,7 +783,7 @@ public class DefaultGraphDisplay implements GraphDisplay {
|
|||
configureViewerPreferredSize();
|
||||
|
||||
Swing.runNow(() -> {
|
||||
// set the graph but defer the layoutalgorithm setting
|
||||
// set the graph but defer the layout algorithm setting
|
||||
viewer.getVisualizationModel().setGraph(graph, false);
|
||||
configureFilters();
|
||||
LayoutAlgorithm<AttributedVertex> initialLayoutAlgorithm =
|
||||
|
@ -795,8 +794,8 @@ public class DefaultGraphDisplay implements GraphDisplay {
|
|||
}
|
||||
|
||||
/**
|
||||
* Determines if a vertex is a root. For our purpose, a root either has no incomming edges
|
||||
* or has at least one outgoing "favored" edge and no incomming "favored" edge
|
||||
* Determines if a vertex is a root. For our purpose, a root either has no incoming edges
|
||||
* or has at least one outgoing "favored" edge and no incoming "favored" edge
|
||||
* @param vertex the vertex to test if it is a root
|
||||
* @return true if the vertex is a root
|
||||
*/
|
||||
|
@ -1208,7 +1207,6 @@ public class DefaultGraphDisplay implements GraphDisplay {
|
|||
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Use the hide selected action states to determine what vertices are shown:
|
||||
* <ul>
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue