Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement git graphing algorithm #6

Draft
wants to merge 7 commits into
base: master
Choose a base branch
from
Draft

Implement git graphing algorithm #6

wants to merge 7 commits into from

Conversation

taylorthurlow
Copy link
Owner

No description provided.

@taylorthurlow taylorthurlow self-assigned this Jun 25, 2020
@taylorthurlow
Copy link
Owner Author

I started with trying to reimplement straight from git's C source, but I suck at reading C and it's hard to tell how it all fits in the big picture.

I started over, starting with implementing a parser for commit-graph files that are built with recent versions of git. This should make it easier and quicker to fetch and parse commit tree data.

The hard part will still be coming up with a graphing algorithm, or copying git's again.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees

@taylorthurlow taylorthurlow

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@taylorthurlow