• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Tim Cooke
  • paul wheaton
  • Ron McLeod
  • Jeanne Boyarsky
Sheriffs:
  • Paul Clapham
Saloon Keepers:
  • Tim Holloway
  • Roland Mueller
Bartenders:

banded matracies

 
Greenhorn
Posts: 26
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
hello there!

i was wondering if someone could point me to a paper on how to implement banded matricies in java (or any other language for that matter, preferably not too syntatically different).

i will use the banded matrix to store adjacency data for a graph for a 3rd year joint comp. science and maths degree. the nodes in the graph are likely to be "locally" connected (i.e. clusters).

at the moment i am using a triangular-come-symmetric matrix, however this is not the most efficient.

thanks,
tian
 
snakes are really good at eating slugs. And you wouldn't think it, but so are tiny ads:
Clean our rivers and oceans from home
https://www.kickstarter.com/projects/paulwheaton/willow-feeders
reply
    Bookmark Topic Watch Topic
  • New Topic