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 fast version for graphs with “string vertices” #2

Open
aliceklipper opened this issue Oct 4, 2017 · 0 comments
Open

Implement fast version for graphs with “string vertices” #2

aliceklipper opened this issue Oct 4, 2017 · 0 comments
Assignees
@aliceklipper
Labels
enhancement

Comments

@aliceklipper
Copy link
Member

Implement fast versions of flatten and search functions using a hash table to mark/check visited vertices. (Also, type of Vertex will be always string.)
@aliceklipper aliceklipper self-assigned this Oct 4, 2017
@aliceklipper aliceklipper changed the title Implement fast version for graphs with string keys Implement fast version for graphs with “string vertices” Oct 4, 2017
@klippersubs klippersubs deleted a comment from 0xF6 Oct 4, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@aliceklipper aliceklipper

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@aliceklipper