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

Computational complexity involved in g2o #301

Open
RakshaMu opened this issue Sep 3, 2018 · 2 comments
Open

Computational complexity involved in g2o #301

RakshaMu opened this issue Sep 3, 2018 · 2 comments
Labels
Stale

Comments

@RakshaMu
Copy link

RakshaMu commented Sep 3, 2018

Hello!

What is the computational complexity involved with g2o? I am trying to plot "number of nodes" vs "time". The graph is linear.
@jlblancoc
Copy link
Contributor

I would say it should be something in between O(N) and O(N^3), depending on how sparse or how connected is the graph.

Basically, the algebra marks the limit...

@github-actions GitHub Actions
Copy link

This issue is stale because it has been open 60 days with no activity. Remove stale label or comment or this will be closed in 14 days.

@github-actions github-actions bot added the Stale label Jan 14, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Stale
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@jlblancoc @RakshaMu