Let A:=[1,2,1,6,6,2,1,1,1,4,5,2,4,5,6,7,1] say

Then I want find the

1) number of times each of the each of the element occurs
2) To multiple the number by the number of times it occurs

3) Then to multple the all these that is in the above

(3*(2)) *(3*(6))*(3*(2))*(2*(4))*(2*(5))*(1*(7))*(5*(1)) = need this value

Here we can observe 3 is the number of times 2 occurs 

3 is the number of times 6 occurs

similiary 5 is the number of times 1 occurs so on

Kind help

Given a Graph G kind help to write a function F to compute values Based on Neighboorhood

Another_type_using_neighborhood.pdf

Your help will be greatly acknowleged greatly

looking for a simple code kind help

Looking to write a function f which takes a weighted graph g and returns values with are distance based

Kind help please your help will be acknowleged

Try_code_based_with_distance.pdf

Please kind help

Looking for simple code

 I am looking to program to create a function which can take a weighted Graph G and output me a array of computed values as an list 

I have around 15 values to be found 

say a function

Compute(graph::g)

I am mainly look for a simple way to code all these in fewer number of lines kind help in that

I attach a PDF file on what i require     Trying_to_code_1.pdf

Kind help

The main ideas i need are

1) How to do sum over edges of a graph G in a simple line of code

2) How to Product sum  over edges of a graph G in a simple line of code

Each one of your help will be greatly apprieciated Please kind help and it will be acknowleged too

Convert undirected graph unweighted graph to a weighted graph even though all the weights are 1

as i want to check how my function works on weighted graph as I know it works unweighted