Awesome Open Source
Search
Programming Languages
Languages
All Categories
Categories
About
Search results for edge boost
boost
x
edge
x
4 search results found
Voronoi
⭐
487
A C implementation for creating 2D voronoi diagrams
Edmonds Alg
⭐
13
Implementation of maximum branching algorithm (max spanning tree in directed graphs)
Colors_in_image
⭐
5
Detects dominate colors in an image using the edge detection algorithms to weight important colors and eventually object detection. Image access and manipulation by GIL included in the boost libraries, and some external GIL extensions not included in boost.
Dynamic Connectivity
⭐
5
There is given an undirected graph G = (V, E) from which edges are deleted one at a time. Questions like "Are the vertices u and v in the same connected component?" have to be answered in constant time.
Related Searches
C Plus Plus Boost (2,992)
Graph Edge (1,528)
Python Edge (1,510)
Javascript Edge (1,332)
Cmake Boost (618)
Python Boost (366)
1-4 of 4 search results
Privacy
|
About
|
Terms
|
Follow Us On Twitter
Copyright 2018-2024 Awesome Open Source. All rights reserved.