Network algorithms

$20-75 USD

Ολοκληρώθηκε

Αναρτήθηκε

πάνω από 7 χρόνια πριν

$20-75 USD

Πληρωμή κατά την παράδοση

Given an list of links FROM to TO, we wish to have a output list of all networks present in the input. We automatically reject all bid spam. In order to be considered for this project, answer the following questions: Which development language do you plan to use? Which algorithm(s) is (are) suitable for providing the solution? Provide a small example output. No code, just an example of the output you envision.

Software Development

Ταυτότητα εργασίας: 12999844

Σχετικά με την εργασία

2 προτάσεις

Απομακρυσμένη Εργασία

Ενεργός/ή 7 χρόνια πριν

Ψάχνεις τρόπο για να κερδίσεις μερικά χρήματα;

Διεύθυνση Email

Πλεονεκτήματα πλειοδοσίας στο Freelancer

Καθόρισε τον προϋπολογισμό σου και το χρονοδιάγραμμα

Πληρώσου για τη δουλειά σου

Περίγραψε την πρόταση σου

Η εγγραφή και η πλειοδοσία σε εργασίες είναι δωρεάν

Βραβεύτηκε στον/στην:

@algispetkuns

not a bot. know graph stuff more or less. can use python/networkx for a job. this will allow easy export to gephi , which is great GUI tool for graph works. coder with more than 10 years of experience.

$66 USD σε 10 ημέρες

5,0

(2 αξιολογήσεις)

2,5

2 freelancers δίνουν μια μέση προσφορά $68 USD για αυτή τη δουλειά

@lukepl

Assuming I understood the problem correctly the goal is to identify complete unique graphs in the provided list of edges. Example output could probably look something like: [[2901_1, 3070_1], [10397_1, 3070_1], [10543_1, 3070_1], [3070_1, 2356_1], [2356_1, 106_1], ... ], [...], [...] Basically a collection of graphs, where each graphs is a collection of edges, where each edge connects two vertices. Could be in XML or JSON notation as well. There're many options. I've taken real IDs from sample data, although even this first graph isn't complete - I stopped looking for more nodes when I realized it could ponentially become quite huge. Anyway, it looks like an interesting problem from graphs theory and something I'd be happy to think about more. It could certainly be solved in almost any language, but I would probably have a go with Java or C# as these are nicely objective languages and I've used them both for several years full time. Also, I've noticed some nodes that seem to be connected only to themselves (e.g. 10002_1) - are they 'degenerated', one-node networks, or should simply be ignored? Let me know in case of any additional questions. Regards, Luke

$70 USD σε 10 ημέρες