-
Hi this is the issue about the neighbors.
We are not looking for a “plug-and-play” implementation. The cases are often so different that it becomes difficult to be too general. So we would rather b…
-
```
What version of the product are you using? On what operating system?
Visual Studio 2008, Windows
Please provide any additional information below.
I have downloaded the "KShortestPath_1.0.3.zip" …
-
This is related to https://github.com/twitter/cassovary/issues/36 but different. We want the ability of node ids to be Long. The use case is when storing a portion of a huge graph in memory on one mac…
-
This is just a thought, but we should consider making a sparse array similar to `hana::detail::hash_table` for the purpose of making a fast "group by" algorithm. One problem would be that it would hav…
-
| Task | Priority | Comments |
| - | :-: | - |
| Sorting waypoints in Quadtree | **Done** 250a2fa6e17d82e9dce74e9f79537af1b2b98aea | Combine sorting colocated point lists. See #89.
| Writing near-…
yakra updated
3 years ago
-
Some functions accept an `igraph_bool loops` argument to indicate whether loops should be counted or not (e.g. `igraph_degree`, `igraph_strength`). I would propose to introduce a new type `igraph_loop…
-
A few things
(6 marks) For these six sub-questions, you are not allowed to use any additional data structure.
What is the tightest time complexity of DFS if it is run from a source vertex v of a gra…
-
Also a usecase for Dijkstra: https://github.com/milasudril/cheapest_route. In this case the graph is implicit. In particular, it will use 32 outgoing search directions. Also, it is not interesting to …
-
It would be nice to have a template method like `menu_data`, that return the menu data as an array, but already hierarchical sorted, so it's easier to use it to create your own menus with submenus.
I…
-
I'm encountering an issue in defining the q_args for 'num_servers' in case of connecting two queues to the same node. In my case each node has number of servers. Let's say two queues (labeled '2' and …