search

bevanwsjones / Disa

Linear Algebra Library
MIT License
2 stars 0 forks source link

Graphing overhaul: Bipartite, Directed, Undirected Graph #73

Open bevanwsjones opened 7 months ago

bevanwsjones commented 7 months ago

colour:

Currently, the adjacency graphs assume the nodes of the graph are all the same 'colour' or type. This has implications for the size and memory layout of the graphs. However, if one allows for the graphs to account for different 'colours' or types of nodes the memory layout would differ. Specifically, the new interpretation would be every row represents a single node colour and each column, its connection to a node of the second colour. Some things to resolve:

ordering

Currently, every row of an Adjacency Graph has its entries sorted in an ascending fashion. This allows for faster insert and search times. However, in some cases, the order of connections may inform some kind of further/underlying graph structure. Currently, the Adjacency graph cannot support this since the ordering is done automatically.

open questions:

  1. Is colour the best term to use for different node types?
  2. Is it an 'Adjacency Graph' -> when storing the relation shit between two different sets.
  3. If the colour what implemented into a different class, would it make sense for that class to also have ordering/unordering?
bevanwsjones commented 7 months ago

Ok chatgpt has ansered -> Bipartite Graph