Vector35 / Vector35/binaryninja-api

API for FlowGraph.find_path()

Open
#3,507 5 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Component: API Effort: Low Impact: Low
Dominant language
C++
Stars
1.3k
Forks
298
Avg merge
5d 5h
Merged PRs (30d)
19

Description

What is the feature you'd like to have?

>>> type(graph)
<class 'binaryninja.flowgraph.FlowGraph'>
>>> graph.find_paths("foo", "bar")

I've implemented BFS, DFS, and A* for often right now for Binja that I'd just like to see it in the box.
It would be create that I could easily do something like:

current_function.mlil.graph.find_paths(0x11111, 0xfffff)

Is your feature request related to a problem?
No problem, just think it would be neat and its not to hard to implement.

Are any alternative solutions acceptable?
I can keep using what I have now, but "batteries included" would be nice.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by locating the FlowGraph API entry point and reviewing the existing current_function.mlil.graph usage. Compare the requested find_path(s) interface with the proposed BFS, DFS, and A* approaches, then define traversal behavior and supported arguments before implementation. Done means the chosen API is available on FlowGraph and its behavior is documented and tested.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
api, reverse-engineering
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.