It would be better if the application displays directed graphs with arrows and weights.

Currently it overlaps different weight edges back and forth.

For example,
Sample input:
4 0 1 2 3 0 0 2 1 1 0 0 4 0 0 0 0 0

Sample output:

the code does not run in python 3

Here's the output from my console:

%Run a_star_search.py
File "/Users/student/Downloads/Visualization-of-popular-algorithms-in-Python-master/A* Search/a_star_search.py", line 40
final_path = []
^
SyntaxError: inconsistent use of tabs and spaces in indentation

Any idea as to what i'm doing wrong, or is this a problem with the program itself?

Thanks

I am getting the same above error. Can u please help me about what is suppose to be done to remove the error

Originally posted by @pavithrahareddy in #36 (comment)

File "main.py", line 54
color_map = ['blue'] * len(G.nodes())
^
TabError: inconsistent use of tabs and spaces in indentation

Please tell me how to resolve this error

File "greedy_bfs.py", line 103, in
greedyBFS(G, source, dest, heuristics, pos)
File "greedy_bfs.py", line 41, in greedyBFS
goal = greedyBFSUtil(G, source, visited, final_path, dest, 0)
File "greedy_bfs.py", line 24, in greedyBFSUtil
pq,size = getPriorityQueue(G[v])
File "greedy_bfs.py", line 10, in getPriorityQueue
q.put(Ordered_Node(heuristics[node],node))
File "C:\Users\raghu\AppData\Local\Programs\Python\Python36-32\lib\queue.py", line 143, in put
self._put(item)
File "C:\Users\raghu\AppData\Local\Programs\Python\Python36-32\lib\queue.py", line 227, in _put
heappush(self.queue, item)
TypeError: '<' not supported between instances of 'Ordered_Node' and 'Ordered_Node'

As you can see above, it is giving me a non optimal solution for an admissible heuristic. Am I wrong or is your algorithm wrong? Please help.

Heuristics and input is below.

Thanks.

prims algorithm please solve TypeError: 'map' object is not subscriptable

Hi,

Thanks a lot for this useful repo
I've browsed through all algorithms
However, I can't find any info online regarding "Egocentric Network"
I do not understand what it does either, from the source code
Care to attach some links or add a README.md for it?

Thanks!

i am new in python so using this code i got this error:
Traceback (most recent call last):
File "C:/Users/Nano_/PycharmProjects/graph/graph.py", line 76, in
G = CreateGraph()
File "C:/Users/Nano_/PycharmProjects/graph/graph.py", line 58, in CreateGraph
if wtMatrix[i][j] > 0 :
TypeError: 'map' object is not subscriptable

I'm trying to start Travelling Salesman Problem
on both python 2.7 and 3.5 have an error

TypeError Traceback (most recent call last)
in ()
156 plt.figure(1)
157 pos = DrawGraph(G,'black')
--> 158 opGraph = christofedes(G, pos)
159 plt.figure(2)
160 pos1 = DrawGraph(opGraph,'r')

in christofedes(G, pos)
95 # finds the hamiltonian circuit
96 curr = start
---> 97 visited[curr] = True
98 for nd in MST.neighbors(curr):
99 if visited[nd] == False or nd == start:

TypeError: list indices must be integers, not dict

when i try to run the dfa code it is showing some error