1. Read in a graph from [login to view URL] in the following format:
node# 1st-arc-to-node# weight-for-previous-arc 2nd-arc-to-node# weight-for-previous-arc 3rd-arc-to-node# weight-for-previous-arc ...
As an example:
1 2 10 3 5 4 100
2 1 5
4 3 50 2 10
In the above example, node 1 has an arc with weight 10 to node 2, weight 5 to node 3, and weight 100 to node 4. Node 2 has an arc with weight 5 to node 1. Node 4 has an arc to node 3 with weight 50 and to node 2 with weight 10.
Note that in the above example, there IS a node 3 despite not being specifically declared on a line. Any node that is either explicitly defined on its own line, or into which an arc goes, must be considered to exist.
2. Display an ascii art image of the graph on the screen. An sample for the above example is shown below. It is not the only possible example:
+-----5-------->[3]
| ^
| |
| 50
| |
+->[1]--10-->[2]<-10-+
| | | |
+---=---5-----+ |
| |
100 |
| |
V |
[4]---------------+
As can be seen in the above example, use the following format:
• nodes are written inside brackets
• vertical lines are drawn with |
• horizontal lines are drawn with -
• 90 degree bends, and intersections between lines (in order to share one line between two arcs) are drawn with +
• a horizontal line crossing but not intersecting with a vertical line is drawn with an =
• arc weights are written somewhere on the arc's line; if a line is shared between two arcs, only the part of the line used by only ONE arc may show the arc weight
• to draw arrows, use <, >, V, and ^.
You do NOT need to optimize for the least number of crosses, turns, or intersections. You DO need to account for every possible graph where id(v) + od(v) <= 4 for all nodes v.
3. Display a chart, in an easily readable format, of the shortest path between each node s and every node t reachable from node s.
Hello
I'm interesting your project very well
I'm a Good C++, Java, Math, Algorithm expert.
I understand your req exactly.
I m quite well experienced in these jobs.
Let's go ahead with me
I want to service for you continously.
Thanks
I am very proficient in c, c++. I have 16 years c++ developing experience now, and I have worked for 6 years. My work is online game developing, and mainly focus on server side, the language is c++ under linux. I used c++ to make many great projects, for example, I made the tools which can convert java files to c++ scripts which has the same effect, of course garbage collection included. I also made our own mobile game using c++, I even can show you the demo of client. Trust me, please let expert help you.
can do it,I have already did this,but can implement different assigment for you ! can do it,I have already did this,but can implement different assigment for you !
Good evening
Points 1 & 3 are of course trivial (basic data loading and Dijkstra's algorithm). However, part 2 looks a little bit too complicated. Is it the only acceptable solution?
Kind Regards
Martin
1. the first part of the question involves string algorithms
2. the second part also involves string algorithms
3. the third part involves graph algorithms
This can be done within 5 hours............please message me to discuss about the details
Hello Sir.
I have been working with datastructures in chip design for 5 years. I can develop a quick algorithm to display the ascii image. Kindly let me work on this sir. Thanks!