MathGroup Archive 2011

[Date Index] [Thread Index] [Author Index]

Search the Archive

zigzag structure

  • To: mathgroup at
  • Subject: [mg122372] zigzag structure
  • From: Gabriele Avolio <gabriele.avolio at>
  • Date: Wed, 26 Oct 2011 17:42:04 -0400 (EDT)
  • Delivered-to:


Does anyone know how to implement the type of structure described here ?

The structure can be seen as a group of oriented graphs, for example:

1->2->3->4   5->2->3   6->3->7    where each subgraph has respectively
name: d1, d2, d3

I'd like to manage such structure, so:
- select node with subgraph in common. for the example above the
intersection of d1 and d2 is node 2 and 3
- append and remove node to a subgraph
- append label to node
and so on.

Which programming pattern should I follow? Is it better to develop
this structure in .Net and then use  the .NET/Link ? Could anyone give
me an hint ?


  • Prev by Date: Conditional Import
  • Next by Date: Re: Integral points on elliptic curves
  • Previous by thread: Re: Conditional Import
  • Next by thread: Overdetermined Matrix Equation Subject to Constraints