graph_only_from_directed_graph_sunday.py, this generates a random graph with the above stated requirement

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Python 3 ( don’t use fence modules, only Graphviz, Networkx, OS, Mathplotlib) Digraph containing the following:-

Vertices random between 10 to 14 Edges random between 1 t0 4 Each edge to be labelled with random real weight between 0 and 1 No multiple arcs u →v between same ordered pair, loops are allowed Designate 1 random vertex as Start (to be coloured green in dot file image), Designate 3 random vertices as Target (to be coloured red in dot fileimage)

Generate an Adjacency matrix representation of the above, and perform the below searches using the Start and Target vertices above:-

BFS DFS Uniform-cost Search Iterative deepening search A* search Iterative Deepening A* search. Searches should return the following:- Path (i.e. example Nodes 1→ 3 → 5) Path length Path cost Search should stop as soon as any of the three targets are reached.

The zip file attached consists of the following programs:-

1) graph_only_from_directed_graph_sunday.py, this generates a random graph with the above stated requirements, the only issue I am having with this is to assign red and green colours to s (Start) and t (target) nodes in the dot file generator line 164, program is currently setup to colour specific nodes but was not able to figure out how to assign a variable instead.

2) Driver.py, this should be the main program that calls all other modules, in it I wrote the program that will give the desired output once program is complete.

3) graph_searchesREVb.py this program is supposed to convert the dot file generated earlier to an adjacency matrix and than carry out the searches. I did not start working on the searches much yet as I was stuck trying to convert the dot file but was unsuccessful as I was not able to strip the [label= ], and was unable to split with 2 different delimiters. Therefore for the time being I was inputting the “filtered dot file” manually, when the program prompts for Graph input.

4) directed_graph15th, contains another different attempt to convert the dot file to matrix see function def convert_dot_to_matrix(n): still doesn’t work properly

 

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of