Improved graph layout algorithm, add trivial edges until edge routing is written

1 files changed, 1 insertions, 1 deletions

diff --git a/binaryninjaapi.h b/binaryninjaapi.h
index 4e6c09b3..113ecfc7 100644
--- a/binaryninjaapi.h
+++ b/binaryninjaapi.h
@@ -781,7 +781,7 @@ namespace BinaryNinja
 		void StartLayout();
 		bool IsLayoutComplete();
 		void OnComplete(const std::function<void()>& func);
-		void ClearOnComplete();
+		void Abort();
 
 		std::vector<Ref<FunctionGraphBlock>> GetBlocks() const;