• Home
  • Hubs
  • Companies
  • Stream

KUKURUKU HUB

Find the Best Engineering Talks Write Articles Earn Karma Curate Content

Exact Maximum Clique for Large or Massive Real Graphs

Written by biicode
The excellent performance reported by BBMCSP—an exact maximum clique algorithm tailored for massive real networks— in a previous post...
April 9, 2015 Algorithms
  • 3
  • 17707
  • Y

Social Network Analysis. Spark GraphX

Written by Alex Krot
Today we will learn more about the tasks of social network analysis ( SNA ), and review the Apache...
March 26, 2015 Algorithms
  •  
  • 6337
  • Y

Masking a Class in Boost Graph. Part 2: Completing the Implementation of Concept Support

Written by Vadim Androsov

I’ll briefly remind you of the task. There’s a two-dimensional game field consisting of squares. Some of them are vacant and others are occupied. We should find a path through vacant squares from one field position to another one. We implemented the search algorithm in Boost . But it requires...

June 7, 2014 C++
  • 1
  • 4652
  • 1
  • Y

Masking a Class in Boost Graph. Part 1: Let the Interface Be

Written by Vadim Androsov
I had to rebuild a pathfinding algorithm for our game recently. The previous one ( Boost Concepts ) was bad...
June 4, 2014 C++
  •  
  • 7376
  • 2
  • Y

Hi Everyone! We are about to launch a new project very soon - CrowdMind.co. Sign up to get a private beta access!

  • About
  • Rules
  • Privacy Policy
  • ·
  • Twitter
  • Facebook

Log In

Forgot password?


or
  • Sign in with Github
  • Sign in with Twitter
We'll never post to your Twitter, Facebook or Github account without your permission.
Don't have an account? Sign up now

Sign Up



or
  • Sign in with Github
  • Sign in with Twitter
We'll never post to your Twitter, Facebook or Github account without your permission.
Already have an account? Log in here

Reset Password

Enter the email address associated with your account, and we'll email you a link to reset your password.

Already have an account? Log in here