calcuate the distance from a set of classes via the caller-called relationship
$30-250 USD
已关闭
已发布大约 8 年前
$30-250 USD
货到付款
Calcuate the distance from a set of classes via the caller-called relationship.
For any class C in givenClasses,
if there is a method call such as x.m(...) in C where x's static type is A, then
If A is in givenClasses, then distance(A,C) = 0;
Otherwise distance(A,C) = 1
If there is a method call such as x.m() in A where x's static type is C, then
If A is in givenClasses, then distance(A,C) = 0;
Otherwise distance(A,C) = 1
If there are multiple distantce values, the smallest one is counted only as the distance.
For a given distance distance, your method should start with 1 till distance is reached in the calculation.
Besides returning a set of classes within the distance given by distance from givenClasses, your program should establish the mapping relationship from a pair of classes to an integer which denotes the shortest distance between the pair.C
Hello
I am Java and C expert and interested in this project. I have reviewed your requirements and confident to handle this project perfectly.
Please communicate to discuss further.
Regards
Anshu
How are you?
I am a Mobile App developer and have 5 years experience of program develop.
I have rich develop experience and have developed many apps.
If you choose me, I will do my best for you.
I understand your project and will complete fast.
I wait your positive reply and you may believe me.
Thank you very much.
Hello,
Before you select a part time developer from here, take a look at fugacode.com. If you like what you see, contact us. That's all.
"Why hire freelancers? when you can hire professional developers for the same cost"
Regards,
FUGACODE Team
I am an IITK graduate, 9 year experienced software professional and I have got top notch developers in my team, who have got experience across a span of technologies. The members in my team have worked with top notch tech organization such as Amazon, Cisco, Oracle etc. We have been involved in similar projects in the past and our track record has been excellent.
Hi,
I have got some idea regarding your requirement its doable but I will need some doubts, so we can have a small chat and discuss further.
I have 6 yrs of exp in java so I can assure you that I can do your job with highest quality.
All my previous projects got 5/5 rating so you be assured of timely delivery and quality.
Looking forward to work with you.
I am an senior Java developer and I have coped with several projects, both small and more complex ones.
I have a very strong academic background in algorithms and complexity, information systems and in software development.
I have an M.Sc. in Computer Science and I work as a telecommunications engineer in my regular job.
I have very strong analytical and researching skills, as I have a research background (I worked in a technological research center for more than 2 years).
I believe I can deliver your project in a reasonable time, after setting the exact requirements.
<<<< Please chat first i can help you low budget >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))
Hi,
Greeting of the day!!!
This is Hasan Ali, introducing myself as freelancer here, having almost 8 years of total work experience as Business Analyst, Software Testing and Quality Assurance.
As I am new here so you can see that I have no ratings and testimonials but I assure you work competence.
Feel free to contact for further discussion.
Regards
Hasan
Hi,
This should be a fairly straightforward project. Off the top of my head, we can enumerate the method calls in a class using ASM or a similar bytecode manipulation library if we are dealing with compiled classes, or possibly simply regex if we are dealing with uncompiled .java files. From there, we can model the classes as vertices and method calls as edges, and use Djikstra's algorithm to find the shortest path, i.e. the distance between classes.