python (12.9k questions)
javascript (9.2k questions)
reactjs (4.7k questions)
java (4.2k questions)
java (4.2k questions)
c# (3.5k questions)
c# (3.5k questions)
html (3.3k questions)
Algorithm to detect best path in a multigraph
essentially I have a multigraph where each edge has its own identity and the weight of each edge is dependent upon some starting input. I have created a dijkstra-based search algorithm that can detect...
getJiggy
Votes: 0
Answers: 0
Returning a value from a function failed with NoneType
I have a problem with returning a value from an external function.
Function:
def dijkstra(netzwerk,startpunkt,zielpunkt,punkt_geprueft=[],entfernungen={},vorgaenger={}):
if startpunkt not in netzw...
ähmöhm
Votes: 0
Answers: 1
Find the longest path of all shortest pathes in a graph (32 thousand vertexes)
I'm doing my laboratory work, and I need to solve a task. The text of it:
Byteland's rail network consists of N stations, numbered from 1 to N, connected by N-1 two-way rail tracks. Each railway track...

Ростислав Липский
Votes: 0
Answers: 1
How to "decrease priority" in a min-priority queue in Dijkstra's algorithm?
Wikipedia of Dijkstra's algorithm has the following pseudocode, which uses a min-priority queue:
1 function Dijkstra(Graph, source):
2 dist[source] ← 0 // Initializatio...
Forrest Wei
Votes: 0
Answers: 1