Minor graph legibility improvements

recaf-core/src/main/java/software/coley/recaf/services/callgraph/CallGraphService.java

@@ -66,7 +66,8 @@ public CallGraph newCallGraph(@Nonnull Workspace workspace) {
 	public CallGraph getCurrentWorkspaceCallGraph() {
 		CallGraph graph = currentWorkspaceGraph;
 
-		// Lazily initialize the graph so that we don't do a full graph
+		// Lazily initialize the graph so that we don't do a full graph immediately when the workspace is opened.
+		// It will only initialize when a user needs to use it.
 		if (!graph.isInitialized())
 			CompletableFuture.runAsync(graph::initialize);
 

recaf-core/src/main/java/software/coley/recaf/services/inheritance/InheritanceGraph.java

@@ -30,6 +30,7 @@
 import java.util.LinkedList;
 import java.util.Map;
 import java.util.Queue;
+import java.util.SequencedSet;
 import java.util.Set;
 import java.util.concurrent.ConcurrentHashMap;
 import java.util.function.Function;
@@ -297,7 +298,7 @@ public String getCommon(@Nonnull String first, @Nonnull String second) {
 		if (vertex == null || OBJECT.equals(first) || OBJECT.equals(second))
 			return OBJECT;
 
-		Set<String> firstParents = vertex.allParents()
+		SequencedSet<String> firstParents = vertex.allParents()
 				.map(InheritanceVertex::getName)
 				.collect(Collectors.toCollection(LinkedHashSet::new));
 		firstParents.add(first);