ISOVIS
/
StackGenVis
9
0
Fork 0
Code Issues Pull Requests Releases 2 Wiki Activity
StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 Commits
1 Branch
2 Tags
1.9 GiB
 
 
 
 
Tag: Branch: Tree: e069030893
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'e069030893'
${ noResults }
StackGenVis/frontend/node_modules/edges-to-adjacency-list
History
Angelos Chatzimparmpas e069030893
fix the frontend 		3 years ago
..
test fix the frontend 3 years ago
.npmignore fix the frontend 3 years ago
LICENSE fix the frontend 3 years ago
README.md fix the frontend 3 years ago
e2a.js fix the frontend 3 years ago
package.json fix the frontend 3 years ago

README.md

edges-to-adjacency-list

Converts a collection of edges in a graph to an adjacency list representation. For the more general operation on simplicial complexes, use the stars module.

Example

var e2a = require("edges-to-adjacency-list")

console.log(e2a([
  [0, 1],
  [1, 2],
  [2, 3]
]))

Output:

[ [1],
  [0, 2],
  [1, 3],
  [2]
]

Install

npm install edges-to-adjacency-list

API

require("edges-to-adjacency-list")(edges[, numVertices])

Converts a collection of edges to an adjacency list representation.

  • edges are the edges of the graph
  • numVertices is an optional parameter giving the number of vertices in the graph

Returns An array encoding the adjacency list of the graph

Note Repeated edges will be combined.

Credits

(c) 2014 Mikola Lysenko. MIT License