or an edge '˜e'™ in a graph, ___________of '˜e'™ is defined as the number of shortest paths between all node pairs (vi vj) in the graph such that the shortest path passes through '˜e'™.

🎲 Try a Random Question  |  Total Questions in Quiz: 19  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Big Data: Real Time Big Data Models — practice the complete quiz, review flashcards, or try a random question.

Big Data.


or an edge '˜e'™ in a graph, ___________of '˜e'™ is defined as the number of shortest paths between all node pairs (vi vj) in the graph such that the shortest path passes through '˜e'™.