Skip to main content
304 questions with no answers
Newest Active Bountied Unanswered
Filter by
Sorted by
Tagged with
4 votes
0 answers
1k views

I am trying to understand Thorup's latest priority Queue which has delete_min operation O(log log N) as presented in his paper. He refers to Fredman and Williard's Atomic Heap as a part of his ...
The Amplitwist's user avatar
  • 259
2 votes
0 answers
72 views

There exists a commentary about finding all the edges on any of the shortest paths between two given nodes of a DAG. Presume that I have found such edges as mentioned in this commentary, I can easily ...
user688486's user avatar
  • 193
0 votes
0 answers
44 views

I was given a problem that in a connected, weighted graph G = (N, A), find a connected subgraph G_s = (N_s, A_s), where |N_s| <= l and A_s = {(i, j): i \in N_s, j \in N_s, (i, j) \in A}, such that ...
Chao Wang's user avatar
  • 3
0 votes
0 answers
90 views

My objective is to calculate the expected cost for each path from the starting point to the end point and identify the minimum expected cost for each path when the respective node serves as the ...
stat_man's user avatar
  • 161
0 votes
0 answers
110 views

I am working on this program that reads a file of metro stations and converts it into a graph. Then it does the following tasks: • It identifies all the stations belonging on the same line of a given ...
metsys's user avatar
  • 13
0 votes
0 answers
40 views

I have implemented a dijkstra algorithm that calculates the shortest distance for every node from the start node, but I am not able to retrieve the shortest path for these nodes. I watched a youtube ...
Julien's user avatar
  • 15.3k
0 votes
0 answers
78 views

I am trying to find out the shortest path on this project that I am working on and nothing pops up. I was wondering if I could get any help from here, thanks! The link below leads to my code, I ...
Phil's user avatar
  • 8,197
1 vote
0 answers
397 views

I would like to modify my shortest path finding code to use multithreading and improve its performance. The algorithm must be able to work with negative weights, and as a result, we cannot use ...
Peter Mortensen's user avatar
  • 31.4k
1 vote
0 answers
49 views

i have the following problem: I've downloaded an OSM street graph via OSMNX, converted it to an undirected graph (i don't need two lanes of a street). Then i manually added additional nodes to the ...
Patrick's user avatar
  • 11
0 votes
0 answers
93 views

This is more a theoretical question because I can see this question being asked in an exam. Assuming we have a directed graph G(V,E) with |V| = 10 and we want to know the shortest path from S to all ...
thestudi's user avatar
  • 1
0 votes
0 answers
354 views

I have a large network with 17,765 nodes and 7,4876 edges. I'm using igraph to run most of my analysis. I got stuck on finding the number of shortest paths for different pairs of nodes (around 1 ...
Microdot's user avatar
  • 37
0 votes
0 answers
33 views

I'm trying to make a dijkstra algorithm solution to a finding the shortest path problem. I made use of an adjacency list but i still get this error: AttributeError: 'set' object has no attribute '...
mercy nwoji's user avatar
  • 1
0 votes
0 answers
170 views

Hello I am learning more about graph theory and was recently learning about Bellman Ford. I noticed an example of how Bellman Ford could be used to arbitrage markets and I took some time to understand ...
0xKitsune's user avatar
  • 151
0 votes
0 answers
109 views

I am trying to simulate SDN based shortest path routing using Dijkstra algorithm. Is there anything that I can improve in the following code ? I am using Floodlight controller and trying to optimize ...
Sohaib Raza's user avatar
  • 1
2 votes
0 answers
1k views

I'm trying to create a social graph and I have to write some Prolog in order to get the minimal and the strongest path. My knowledge base only has the following statements: edge(source, destination, ...
miken32's user avatar
  • 42.5k
0 votes
0 answers
47 views

I Have a requirement that has ArrayList that contains Latitude and Longitude (randomly).Is there any way so that I can get this list in a optimized way. Google Map optimization map I am aware of that ...
balderman's user avatar
  • 24k
0 votes
0 answers
383 views

I know DFS is not good choice to find shortest path from a source and BFS or dynamic programming solutions are better but i'm just interested in hypothetical situation of speed of particular algorithm....
Matt Timmermans's user avatar
  • 60.9k
0 votes
0 answers
272 views

I am aware that we need to follow the triangle inequality for consistent heuristic I.e, h(n)< c(n,a,n')+ h(n') My understanding of why it might cause repeated nodes to be expanded is that , suppose ...
Zabuzard's user avatar
  • 26.3k
0 votes
0 answers
12 views

Does anyone have the shortest paths for this network? enter image description here
Lora Allen's user avatar
  • 1
1 vote
0 answers
80 views

So in this project im trying to find the link prediction in the social networks. I have done my test with some of the algorithms, and I decided to work with the Adamic radar algorithm. And I wanted to ...
tous's user avatar
  • 37
1 vote
0 answers
323 views

Problem Statement: Let c1,c2,...cn be various currencies. Between two currencies ci and cj, there is an exchange rate ri,j > 0. These exchange rates satisfy the condition that ri,j * rj,i < 1. ...
Lancelot53's user avatar
  • 11
0 votes
0 answers
609 views

I implemented Dijkstra's algorithm to find the shortest path from the source vertex to all other vertices, and I also wanted to store what vertices make up each shortest path. I did this by keeping ...
martineau's user avatar
  • 124k
0 votes
0 answers
796 views

The following code is the shortest path algorithm code I am using: Algorithm to find the shortest path in a grid bool isValid(std::vector<std::vector<int>>& grid, int i, int j) { ...
Zeyan Wang's user avatar
  • 1
0 votes
0 answers
186 views

Dear people of stackoverflow, I made a routeplanner based on length and elevation. With both costfactors I get only results with an undirected graph. So the code is good for an undirect graph but ...
Damiaan van Harteveld's user avatar
  • 21
0 votes
0 answers
254 views

I want to find the shortest path between several points with the help of osmnx. I use the following code. But its output is only one point. Does anyone know why? import osmnx as ox place_name = "...
user16529463's user avatar
  • 23

1
2 3 4 5
…
7