Suljettu

Write some Software -- 2

Write a program that can accomplish the following:

1. Read in a graph from [url removed, login to view] 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.

Taidot: C++ -ohjelmointi

Näytä lisää: vertical lines and horizontal lines, two lines intersecting, two lines crossing, two intersecting lines, the art of programming, shortest path in graph, programming degree, programming art, path of a graph, path in graph, path graph, part of graph, node graph, lines intersecting, intersections of lines, intersecting lines lines, intersecting lines are, horizontal line example, graph shortest path, graph path

Tietoa työnantajasta:
( 0 arvostelua ) United States

Projektin tunnus: #10513884

7 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön

hbxfnzwpf

I am very proficient in c and c++. I have 16 years c++ developing experience now, and have worked for more than 6 years. My work is online game developing, and mainly focus on server side, using c++ under linux environ Lisää

$100 USD 1 päivässä
(53 arvostelua)
6.1
utkarshkatiyar19

Hi. i have a lot of experience in C/C++ programming of data structures and graphs concepts. . I can easily help you with this project in given time. we can have a chat about it. thanks.

$100 USD 1 päivässä
(45 arvostelua)
5.1
NovaSofts

Hello Sir/Mam NovaSofts Inc. is the leading IT Company of Islamabad Pakistan. We have 9+ years of experience and strong knowledge about programming languages Java C++ C C# Android So you don't worry about thir Lisää

$30 USD 1 päivässä
(43 arvostelua)
5.1
wangbeizou

Hello. Employer. I have read and understood the project. I'm an Expert in Data Structures and Algorithms. And I know well ; Java ,C/C++. I'm interested this project. Firstly I want to discuss with you about thi Lisää

$70 USD 1 päivässä
(12 arvostelua)
4.1
$25 USD 10 päivässä
(2 arvostelua)
1.9
tpeterzhao

Easy, can be done in one day

$20 USD 1 päivässä
(0 arvostelua)
0.0
sourrvvvyy

A proposal has not yet been provided

$15 USD 1 päivässä
(0 arvostelua)
0.0
$25 USD 1 päivässä
(0 arvostelua)
0.0